./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/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 6af52310ec13e6e7a94146d05f9e904086453aae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:31:59,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:31:59,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:31:59,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:31:59,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:31:59,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:31:59,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:31:59,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:31:59,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:31:59,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:31:59,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:31:59,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:31:59,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:31:59,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:31:59,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:31:59,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:31:59,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:31:59,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:31:59,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:31:59,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:31:59,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:31:59,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:31:59,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:31:59,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:31:59,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:31:59,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:31:59,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:31:59,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:31:59,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:31:59,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:31:59,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:31:59,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:31:59,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:31:59,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:31:59,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:31:59,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:31:59,644 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-18 16:31:59,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:31:59,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:31:59,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:31:59,655 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:31:59,655 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:31:59,655 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:31:59,655 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:31:59,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:31:59,655 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:31:59,656 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:31:59,656 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:31:59,656 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:31:59,656 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:31:59,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:31:59,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:31:59,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:31:59,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:31:59,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:31:59,659 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:31:59,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:31:59,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:31:59,660 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:31:59,660 INFO L133 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_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/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 -> 6af52310ec13e6e7a94146d05f9e904086453aae [2018-11-18 16:31:59,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:31:59,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:31:59,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:31:59,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:31:59,693 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:31:59,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-18 16:31:59,729 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/data/655b8aff8/a13cc744842c4ac093a64c4a1c9ea41b/FLAGd4ec95593 [2018-11-18 16:32:00,134 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:32:00,134 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-18 16:32:00,139 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/data/655b8aff8/a13cc744842c4ac093a64c4a1c9ea41b/FLAGd4ec95593 [2018-11-18 16:32:00,148 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/data/655b8aff8/a13cc744842c4ac093a64c4a1c9ea41b [2018-11-18 16:32:00,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:32:00,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:32:00,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:32:00,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:32:00,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:32:00,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00, skipping insertion in model container [2018-11-18 16:32:00,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:32:00,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:32:00,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:32:00,317 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:32:00,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:32:00,351 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:32:00,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00 WrapperNode [2018-11-18 16:32:00,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:32:00,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:32:00,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:32:00,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:32:00,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:32:00,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:32:00,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:32:00,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:32:00,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... [2018-11-18 16:32:00,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:32:00,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:32:00,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:32:00,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:32:00,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/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 [2018-11-18 16:32:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 16:32:00,485 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 16:32:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:32:00,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:32:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:32:00,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:32:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:32:00,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:32:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:32:00,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:32:00,879 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:32:00,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:32:00 BoogieIcfgContainer [2018-11-18 16:32:00,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:32:00,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:32:00,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:32:00,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:32:00,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:32:00" (1/3) ... [2018-11-18 16:32:00,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5729478e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:32:00, skipping insertion in model container [2018-11-18 16:32:00,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:32:00" (2/3) ... [2018-11-18 16:32:00,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5729478e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:32:00, skipping insertion in model container [2018-11-18 16:32:00,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:32:00" (3/3) ... [2018-11-18 16:32:00,889 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-11-18 16:32:00,898 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:32:00,906 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-18 16:32:00,922 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-18 16:32:00,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:32:00,955 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:32:00,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:32:00,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:32:00,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:32:00,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:32:00,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:32:00,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:32:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 16:32:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 16:32:00,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:00,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:00,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:00,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-11-18 16:32:00,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:01,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:01,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:32:01,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:01,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 16:32:01,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:32:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:32:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:32:01,130 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-18 16:32:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:01,150 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-18 16:32:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:32:01,151 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-18 16:32:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:01,160 INFO L225 Difference]: With dead ends: 157 [2018-11-18 16:32:01,160 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 16:32:01,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:32:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 16:32:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-18 16:32:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:32:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-18 16:32:01,188 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-18 16:32:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:01,188 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-18 16:32:01,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:32:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-18 16:32:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:32:01,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:01,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:01,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-11-18 16:32:01,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:01,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:01,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:32:01,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:32:01,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:01,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:32:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:32:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:32:01,280 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-18 16:32:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:01,404 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-18 16:32:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:32:01,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:32:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:01,405 INFO L225 Difference]: With dead ends: 156 [2018-11-18 16:32:01,405 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 16:32:01,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:32:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 16:32:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-18 16:32:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 16:32:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-18 16:32:01,414 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-18 16:32:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:01,415 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-18 16:32:01,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:32:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-18 16:32:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:32:01,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:01,416 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 16:32:01,417 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:01,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-11-18 16:32:01,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:32:01,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:01,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:32:01,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:01,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:01,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:01,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:01,496 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-18 16:32:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:01,710 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2018-11-18 16:32:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:32:01,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 16:32:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:01,712 INFO L225 Difference]: With dead ends: 227 [2018-11-18 16:32:01,712 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 16:32:01,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 16:32:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2018-11-18 16:32:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 16:32:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2018-11-18 16:32:01,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 28 [2018-11-18 16:32:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:01,723 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2018-11-18 16:32:01,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-18 16:32:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:32:01,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:01,725 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 16:32:01,726 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:01,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-11-18 16:32:01,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:01,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:32:01,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:01,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:01,814 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand 4 states. [2018-11-18 16:32:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:01,988 INFO L93 Difference]: Finished difference Result 331 states and 464 transitions. [2018-11-18 16:32:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:32:01,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 16:32:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:01,989 INFO L225 Difference]: With dead ends: 331 [2018-11-18 16:32:01,989 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 16:32:01,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 16:32:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 171. [2018-11-18 16:32:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 16:32:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2018-11-18 16:32:01,999 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 36 [2018-11-18 16:32:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:02,000 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2018-11-18 16:32:02,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2018-11-18 16:32:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 16:32:02,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:02,002 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:02,003 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:02,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-11-18 16:32:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 16:32:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:32:02,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:02,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:32:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:32:02,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:02,077 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand 5 states. [2018-11-18 16:32:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:02,251 INFO L93 Difference]: Finished difference Result 482 states and 665 transitions. [2018-11-18 16:32:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:32:02,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 16:32:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:02,253 INFO L225 Difference]: With dead ends: 482 [2018-11-18 16:32:02,253 INFO L226 Difference]: Without dead ends: 342 [2018-11-18 16:32:02,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:32:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-18 16:32:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-18 16:32:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 16:32:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 252 transitions. [2018-11-18 16:32:02,268 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 252 transitions. Word has length 44 [2018-11-18 16:32:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:02,268 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 252 transitions. [2018-11-18 16:32:02,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:32:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2018-11-18 16:32:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 16:32:02,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:02,269 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:02,270 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:02,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-11-18 16:32:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 16:32:02,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:02,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:32:02,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:02,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:32:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:32:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:02,343 INFO L87 Difference]: Start difference. First operand 185 states and 252 transitions. Second operand 5 states. [2018-11-18 16:32:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:02,533 INFO L93 Difference]: Finished difference Result 490 states and 673 transitions. [2018-11-18 16:32:02,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:32:02,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 16:32:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:02,534 INFO L225 Difference]: With dead ends: 490 [2018-11-18 16:32:02,534 INFO L226 Difference]: Without dead ends: 350 [2018-11-18 16:32:02,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:32:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-18 16:32:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-11-18 16:32:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 16:32:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2018-11-18 16:32:02,543 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 47 [2018-11-18 16:32:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:02,544 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2018-11-18 16:32:02,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:32:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2018-11-18 16:32:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:32:02,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:02,545 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:02,545 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:02,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1002470733, now seen corresponding path program 1 times [2018-11-18 16:32:02,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:02,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:02,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:02,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:02,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:02,631 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-18 16:32:02,633 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:02,662 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:02,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:02,757 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:02,758 INFO L272 AbstractInterpreter]: Visited 19 different actions 19 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:02,763 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:02,810 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 55.76% of their original sizes. [2018-11-18 16:32:02,810 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:02,840 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-18 16:32:02,840 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:02,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-18 16:32:02,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:32:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:32:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:32:02,841 INFO L87 Difference]: Start difference. First operand 200 states and 268 transitions. Second operand 7 states. [2018-11-18 16:32:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:03,284 INFO L93 Difference]: Finished difference Result 949 states and 1307 transitions. [2018-11-18 16:32:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:32:03,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 16:32:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:03,287 INFO L225 Difference]: With dead ends: 949 [2018-11-18 16:32:03,288 INFO L226 Difference]: Without dead ends: 809 [2018-11-18 16:32:03,288 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:32:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-18 16:32:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 205. [2018-11-18 16:32:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 16:32:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2018-11-18 16:32:03,302 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 50 [2018-11-18 16:32:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:03,302 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2018-11-18 16:32:03,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:32:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2018-11-18 16:32:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:32:03,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:03,303 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:03,306 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:03,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -407402124, now seen corresponding path program 1 times [2018-11-18 16:32:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:03,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:03,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:03,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:03,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:03,359 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-18 16:32:03,359 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:03,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:03,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:03,373 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:03,373 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:03,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:03,376 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:03,396 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 61.97% of their original sizes. [2018-11-18 16:32:03,396 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:03,412 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-18 16:32:03,412 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:03,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-18 16:32:03,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:03,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:32:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:32:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:03,413 INFO L87 Difference]: Start difference. First operand 205 states and 275 transitions. Second operand 8 states. [2018-11-18 16:32:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:03,819 INFO L93 Difference]: Finished difference Result 1119 states and 1539 transitions. [2018-11-18 16:32:03,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:32:03,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 16:32:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:03,822 INFO L225 Difference]: With dead ends: 1119 [2018-11-18 16:32:03,822 INFO L226 Difference]: Without dead ends: 979 [2018-11-18 16:32:03,822 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-11-18 16:32:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 205. [2018-11-18 16:32:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 16:32:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2018-11-18 16:32:03,831 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 53 [2018-11-18 16:32:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:03,831 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2018-11-18 16:32:03,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:32:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2018-11-18 16:32:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:32:03,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:03,832 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:03,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash -597025483, now seen corresponding path program 1 times [2018-11-18 16:32:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:03,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:03,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:03,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:03,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-18 16:32:03,892 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:03,894 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:03,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:03,902 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:03,902 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:03,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:03,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:03,918 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 59.23% of their original sizes. [2018-11-18 16:32:03,919 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:03,944 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-18 16:32:03,944 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:03,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-18 16:32:03,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:03,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:32:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:32:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:03,946 INFO L87 Difference]: Start difference. First operand 205 states and 275 transitions. Second operand 8 states. [2018-11-18 16:32:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:04,298 INFO L93 Difference]: Finished difference Result 1106 states and 1522 transitions. [2018-11-18 16:32:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:32:04,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 16:32:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:04,300 INFO L225 Difference]: With dead ends: 1106 [2018-11-18 16:32:04,301 INFO L226 Difference]: Without dead ends: 966 [2018-11-18 16:32:04,301 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-11-18 16:32:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 213. [2018-11-18 16:32:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-18 16:32:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2018-11-18 16:32:04,309 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 53 [2018-11-18 16:32:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:04,309 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2018-11-18 16:32:04,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:32:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2018-11-18 16:32:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:32:04,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:04,310 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:04,311 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:04,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 334860952, now seen corresponding path program 1 times [2018-11-18 16:32:04,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:04,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:04,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:04,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:04,368 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 16:32:04,368 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:04,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:04,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:04,381 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:04,381 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 3. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:04,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:04,388 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:04,401 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 63.6% of their original sizes. [2018-11-18 16:32:04,401 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:04,434 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 16:32:04,434 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:04,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:04,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 16:32:04,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:04,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:32:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:32:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:04,435 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. Second operand 9 states. [2018-11-18 16:32:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:05,042 INFO L93 Difference]: Finished difference Result 1123 states and 1543 transitions. [2018-11-18 16:32:05,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:32:05,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 16:32:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:05,044 INFO L225 Difference]: With dead ends: 1123 [2018-11-18 16:32:05,044 INFO L226 Difference]: Without dead ends: 983 [2018-11-18 16:32:05,045 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-11-18 16:32:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 208. [2018-11-18 16:32:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 16:32:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2018-11-18 16:32:05,053 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 55 [2018-11-18 16:32:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:05,053 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2018-11-18 16:32:05,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:32:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2018-11-18 16:32:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:32:05,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:05,054 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:05,054 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:05,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:05,055 INFO L82 PathProgramCache]: Analyzing trace with hash -526890703, now seen corresponding path program 1 times [2018-11-18 16:32:05,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:05,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:05,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:05,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:05,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 16:32:05,115 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:05,116 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:05,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:05,124 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:05,124 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 3. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:05,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:05,126 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:05,139 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 60.75% of their original sizes. [2018-11-18 16:32:05,139 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:05,172 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 16:32:05,172 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 16:32:05,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:05,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:32:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:32:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:05,173 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand 9 states. [2018-11-18 16:32:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:05,542 INFO L93 Difference]: Finished difference Result 1104 states and 1516 transitions. [2018-11-18 16:32:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:32:05,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 16:32:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:05,544 INFO L225 Difference]: With dead ends: 1104 [2018-11-18 16:32:05,544 INFO L226 Difference]: Without dead ends: 964 [2018-11-18 16:32:05,545 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-18 16:32:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 210. [2018-11-18 16:32:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-18 16:32:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 281 transitions. [2018-11-18 16:32:05,553 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 281 transitions. Word has length 55 [2018-11-18 16:32:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:05,554 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 281 transitions. [2018-11-18 16:32:05,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:32:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 281 transitions. [2018-11-18 16:32:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 16:32:05,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:05,555 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:05,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:05,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1761874644, now seen corresponding path program 1 times [2018-11-18 16:32:05,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:05,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:05,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:05,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:05,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:05,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:05,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:05,605 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-18 16:32:05,606 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:05,607 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:05,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:05,615 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:05,616 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:05,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:05,621 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:05,631 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 64.37% of their original sizes. [2018-11-18 16:32:05,631 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:05,670 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-18 16:32:05,670 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:05,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:05,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 16:32:05,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:32:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:32:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:05,671 INFO L87 Difference]: Start difference. First operand 210 states and 281 transitions. Second operand 9 states. [2018-11-18 16:32:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:06,078 INFO L93 Difference]: Finished difference Result 1263 states and 1737 transitions. [2018-11-18 16:32:06,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:32:06,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-18 16:32:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:06,081 INFO L225 Difference]: With dead ends: 1263 [2018-11-18 16:32:06,081 INFO L226 Difference]: Without dead ends: 1123 [2018-11-18 16:32:06,082 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-18 16:32:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 218. [2018-11-18 16:32:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-18 16:32:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 292 transitions. [2018-11-18 16:32:06,092 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 292 transitions. Word has length 56 [2018-11-18 16:32:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:06,093 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 292 transitions. [2018-11-18 16:32:06,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:32:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2018-11-18 16:32:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 16:32:06,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:06,094 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-11-18 16:32:06,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:06,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1982405281, now seen corresponding path program 1 times [2018-11-18 16:32:06,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:32:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:32:06,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:06,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:32:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:32:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:32:06,130 INFO L87 Difference]: Start difference. First operand 218 states and 292 transitions. Second operand 3 states. [2018-11-18 16:32:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:06,141 INFO L93 Difference]: Finished difference Result 281 states and 378 transitions. [2018-11-18 16:32:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:32:06,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-18 16:32:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:06,143 INFO L225 Difference]: With dead ends: 281 [2018-11-18 16:32:06,143 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 16:32:06,143 INFO L604 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 [2018-11-18 16:32:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 16:32:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-18 16:32:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-18 16:32:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 333 transitions. [2018-11-18 16:32:06,151 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 333 transitions. Word has length 56 [2018-11-18 16:32:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:06,151 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 333 transitions. [2018-11-18 16:32:06,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:32:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 333 transitions. [2018-11-18 16:32:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 16:32:06,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:06,152 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-11-18 16:32:06,153 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:06,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1707645667, now seen corresponding path program 1 times [2018-11-18 16:32:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:32:06,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:06,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:32:06,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:06,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:06,212 INFO L87 Difference]: Start difference. First operand 248 states and 333 transitions. Second operand 4 states. [2018-11-18 16:32:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:06,293 INFO L93 Difference]: Finished difference Result 621 states and 858 transitions. [2018-11-18 16:32:06,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:32:06,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-18 16:32:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:06,295 INFO L225 Difference]: With dead ends: 621 [2018-11-18 16:32:06,295 INFO L226 Difference]: Without dead ends: 447 [2018-11-18 16:32:06,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-18 16:32:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 383. [2018-11-18 16:32:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-18 16:32:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2018-11-18 16:32:06,323 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 56 [2018-11-18 16:32:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:06,323 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2018-11-18 16:32:06,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2018-11-18 16:32:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 16:32:06,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:06,325 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-11-18 16:32:06,325 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:06,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -771491268, now seen corresponding path program 1 times [2018-11-18 16:32:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:32:06,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:06,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:06,410 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-18 16:32:06,410 INFO L202 CegarAbsIntRunner]: [0], [29], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [163], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:06,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:06,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:06,418 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:06,418 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 77 root evaluator evaluations with a maximum evaluation depth of 4. Performed 77 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:06,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,420 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:06,435 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 43.68% of their original sizes. [2018-11-18 16:32:06,435 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:06,457 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-18 16:32:06,457 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-18 16:32:06,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:06,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:32:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:32:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:32:06,458 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 7 states. [2018-11-18 16:32:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:06,690 INFO L93 Difference]: Finished difference Result 1046 states and 1441 transitions. [2018-11-18 16:32:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:32:06,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-18 16:32:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:06,693 INFO L225 Difference]: With dead ends: 1046 [2018-11-18 16:32:06,693 INFO L226 Difference]: Without dead ends: 879 [2018-11-18 16:32:06,694 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:32:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-18 16:32:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 383. [2018-11-18 16:32:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-18 16:32:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2018-11-18 16:32:06,710 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 56 [2018-11-18 16:32:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:06,710 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2018-11-18 16:32:06,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:32:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2018-11-18 16:32:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:32:06,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:06,712 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:06,712 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:06,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash -265435344, now seen corresponding path program 1 times [2018-11-18 16:32:06,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:06,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:06,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:06,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:06,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 16:32:06,766 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:06,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:06,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:06,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:06,774 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 3. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:06,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:06,776 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:06,788 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 65.49% of their original sizes. [2018-11-18 16:32:06,788 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:06,823 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 16:32:06,823 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 16:32:06,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:06,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:32:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:32:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:06,825 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 10 states. [2018-11-18 16:32:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:07,309 INFO L93 Difference]: Finished difference Result 1863 states and 2573 transitions. [2018-11-18 16:32:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:32:07,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-18 16:32:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:07,312 INFO L225 Difference]: With dead ends: 1863 [2018-11-18 16:32:07,312 INFO L226 Difference]: Without dead ends: 1693 [2018-11-18 16:32:07,313 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-11-18 16:32:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 375. [2018-11-18 16:32:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-18 16:32:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 511 transitions. [2018-11-18 16:32:07,329 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 511 transitions. Word has length 58 [2018-11-18 16:32:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:07,330 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 511 transitions. [2018-11-18 16:32:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:32:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 511 transitions. [2018-11-18 16:32:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:32:07,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:07,331 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-11-18 16:32:07,331 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:07,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1366600944, now seen corresponding path program 1 times [2018-11-18 16:32:07,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:07,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:07,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:07,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:07,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:07,373 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 16:32:07,373 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:07,374 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:07,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:07,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:07,380 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 3. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:07,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:07,388 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:07,397 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 65.49% of their original sizes. [2018-11-18 16:32:07,397 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:07,439 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 16:32:07,439 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 16:32:07,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:32:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:32:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:07,440 INFO L87 Difference]: Start difference. First operand 375 states and 511 transitions. Second operand 10 states. [2018-11-18 16:32:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:07,966 INFO L93 Difference]: Finished difference Result 1866 states and 2574 transitions. [2018-11-18 16:32:07,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:32:07,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-18 16:32:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:07,969 INFO L225 Difference]: With dead ends: 1866 [2018-11-18 16:32:07,969 INFO L226 Difference]: Without dead ends: 1696 [2018-11-18 16:32:07,970 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2018-11-18 16:32:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 375. [2018-11-18 16:32:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-18 16:32:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 511 transitions. [2018-11-18 16:32:07,986 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 511 transitions. Word has length 58 [2018-11-18 16:32:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:07,987 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 511 transitions. [2018-11-18 16:32:07,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:32:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 511 transitions. [2018-11-18 16:32:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:32:07,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:07,988 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:07,988 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:07,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -205323678, now seen corresponding path program 1 times [2018-11-18 16:32:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:07,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:07,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:32:08,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:08,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:32:08,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:08,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:08,040 INFO L87 Difference]: Start difference. First operand 375 states and 511 transitions. Second operand 4 states. [2018-11-18 16:32:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:08,149 INFO L93 Difference]: Finished difference Result 1081 states and 1517 transitions. [2018-11-18 16:32:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:32:08,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-18 16:32:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:08,152 INFO L225 Difference]: With dead ends: 1081 [2018-11-18 16:32:08,152 INFO L226 Difference]: Without dead ends: 767 [2018-11-18 16:32:08,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:32:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-18 16:32:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 666. [2018-11-18 16:32:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-18 16:32:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 915 transitions. [2018-11-18 16:32:08,171 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 915 transitions. Word has length 59 [2018-11-18 16:32:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:08,172 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 915 transitions. [2018-11-18 16:32:08,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 915 transitions. [2018-11-18 16:32:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 16:32:08,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:08,173 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 16:32:08,173 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:08,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash 303652972, now seen corresponding path program 1 times [2018-11-18 16:32:08,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:08,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:32:08,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:08,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:08,212 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 16:32:08,212 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [204], [208], [210], [213], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:08,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:08,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:08,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:08,219 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Performed 87 root evaluator evaluations with a maximum evaluation depth of 3. Performed 87 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 16:32:08,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:08,220 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:08,234 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 66.39% of their original sizes. [2018-11-18 16:32:08,235 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:08,271 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 16:32:08,272 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 16:32:08,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:08,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:32:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:32:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:08,273 INFO L87 Difference]: Start difference. First operand 666 states and 915 transitions. Second operand 11 states. [2018-11-18 16:32:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:08,921 INFO L93 Difference]: Finished difference Result 1847 states and 2544 transitions. [2018-11-18 16:32:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:32:08,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-18 16:32:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:08,924 INFO L225 Difference]: With dead ends: 1847 [2018-11-18 16:32:08,924 INFO L226 Difference]: Without dead ends: 1677 [2018-11-18 16:32:08,925 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2018-11-18 16:32:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 648. [2018-11-18 16:32:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-18 16:32:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 892 transitions. [2018-11-18 16:32:08,946 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 892 transitions. Word has length 60 [2018-11-18 16:32:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:08,946 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 892 transitions. [2018-11-18 16:32:08,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:32:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 892 transitions. [2018-11-18 16:32:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 16:32:08,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:08,947 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:08,948 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:08,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1111349346, now seen corresponding path program 1 times [2018-11-18 16:32:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:08,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:09,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:09,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:09,001 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-18 16:32:09,001 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:09,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:09,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:09,020 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:09,020 INFO L272 AbstractInterpreter]: Visited 41 different actions 46 times. Merged at 4 different actions 4 times. Never widened. Performed 149 root evaluator evaluations with a maximum evaluation depth of 4. Performed 149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:09,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:09,022 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:09,042 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 51.21% of their original sizes. [2018-11-18 16:32:09,042 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:09,085 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-18 16:32:09,085 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:09,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:09,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 16:32:09,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:09,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:32:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:32:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:09,087 INFO L87 Difference]: Start difference. First operand 648 states and 892 transitions. Second operand 10 states. [2018-11-18 16:32:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:09,624 INFO L93 Difference]: Finished difference Result 1378 states and 1892 transitions. [2018-11-18 16:32:09,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:32:09,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-11-18 16:32:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:09,627 INFO L225 Difference]: With dead ends: 1378 [2018-11-18 16:32:09,627 INFO L226 Difference]: Without dead ends: 1211 [2018-11-18 16:32:09,628 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:32:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-18 16:32:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 696. [2018-11-18 16:32:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-18 16:32:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 950 transitions. [2018-11-18 16:32:09,652 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 950 transitions. Word has length 65 [2018-11-18 16:32:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:09,653 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 950 transitions. [2018-11-18 16:32:09,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:32:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 950 transitions. [2018-11-18 16:32:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:32:09,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:09,654 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:09,654 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:09,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1250580803, now seen corresponding path program 1 times [2018-11-18 16:32:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:09,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:09,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:09,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:09,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:09,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 16:32:09,706 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:09,707 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:09,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:09,717 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:09,717 INFO L272 AbstractInterpreter]: Visited 44 different actions 49 times. Merged at 4 different actions 4 times. Never widened. Performed 157 root evaluator evaluations with a maximum evaluation depth of 4. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:09,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:09,719 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:09,734 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 57.38% of their original sizes. [2018-11-18 16:32:09,734 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:09,789 INFO L415 sIntCurrentIteration]: We unified 67 AI predicates to 67 [2018-11-18 16:32:09,789 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:09,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 16:32:09,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:32:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:32:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:09,790 INFO L87 Difference]: Start difference. First operand 696 states and 950 transitions. Second operand 11 states. [2018-11-18 16:32:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:10,469 INFO L93 Difference]: Finished difference Result 1744 states and 2391 transitions. [2018-11-18 16:32:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:32:10,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 16:32:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:10,472 INFO L225 Difference]: With dead ends: 1744 [2018-11-18 16:32:10,472 INFO L226 Difference]: Without dead ends: 1577 [2018-11-18 16:32:10,473 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2018-11-18 16:32:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 696. [2018-11-18 16:32:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-18 16:32:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 950 transitions. [2018-11-18 16:32:10,497 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 950 transitions. Word has length 68 [2018-11-18 16:32:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:10,497 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 950 transitions. [2018-11-18 16:32:10,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:32:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 950 transitions. [2018-11-18 16:32:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:32:10,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:10,499 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:10,499 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:10,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1474492636, now seen corresponding path program 1 times [2018-11-18 16:32:10,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:10,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:10,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:10,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:10,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:10,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 16:32:10,547 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:10,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:10,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:10,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:10,558 INFO L272 AbstractInterpreter]: Visited 44 different actions 49 times. Merged at 4 different actions 4 times. Never widened. Performed 157 root evaluator evaluations with a maximum evaluation depth of 4. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:10,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:10,564 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:10,578 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 56.34% of their original sizes. [2018-11-18 16:32:10,578 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:10,625 INFO L415 sIntCurrentIteration]: We unified 67 AI predicates to 67 [2018-11-18 16:32:10,625 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:10,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:10,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 16:32:10,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:10,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:32:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:32:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:10,626 INFO L87 Difference]: Start difference. First operand 696 states and 950 transitions. Second operand 11 states. [2018-11-18 16:32:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:11,040 INFO L93 Difference]: Finished difference Result 1636 states and 2235 transitions. [2018-11-18 16:32:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:32:11,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 16:32:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:11,043 INFO L225 Difference]: With dead ends: 1636 [2018-11-18 16:32:11,043 INFO L226 Difference]: Without dead ends: 1469 [2018-11-18 16:32:11,044 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-11-18 16:32:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 704. [2018-11-18 16:32:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-18 16:32:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 961 transitions. [2018-11-18 16:32:11,067 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 961 transitions. Word has length 68 [2018-11-18 16:32:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:11,067 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 961 transitions. [2018-11-18 16:32:11,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:32:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 961 transitions. [2018-11-18 16:32:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:32:11,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:11,068 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:11,069 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:11,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1593569917, now seen corresponding path program 1 times [2018-11-18 16:32:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:11,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:32:11,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:11,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:11,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 16:32:11,114 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [117], [121], [124], [126], [128], [140], [150], [160], [163], [167], [169], [173], [175], [179], [181], [187], [193], [196], [198], [204], [208], [210], [215], [221], [225], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:11,115 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:11,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:11,130 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:11,130 INFO L272 AbstractInterpreter]: Visited 46 different actions 66 times. Merged at 10 different actions 14 times. Never widened. Performed 228 root evaluator evaluations with a maximum evaluation depth of 4. Performed 228 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:11,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:11,136 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:11,156 INFO L227 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 54.83% of their original sizes. [2018-11-18 16:32:11,156 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:11,213 INFO L415 sIntCurrentIteration]: We unified 67 AI predicates to 67 [2018-11-18 16:32:11,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:11,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:11,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-18 16:32:11,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:11,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:32:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:32:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:11,215 INFO L87 Difference]: Start difference. First operand 704 states and 961 transitions. Second operand 13 states. [2018-11-18 16:32:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:12,381 INFO L93 Difference]: Finished difference Result 1533 states and 2075 transitions. [2018-11-18 16:32:12,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:32:12,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-11-18 16:32:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:12,384 INFO L225 Difference]: With dead ends: 1533 [2018-11-18 16:32:12,384 INFO L226 Difference]: Without dead ends: 1366 [2018-11-18 16:32:12,385 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:32:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2018-11-18 16:32:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 750. [2018-11-18 16:32:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-18 16:32:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1015 transitions. [2018-11-18 16:32:12,414 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1015 transitions. Word has length 68 [2018-11-18 16:32:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:12,414 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1015 transitions. [2018-11-18 16:32:12,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:32:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1015 transitions. [2018-11-18 16:32:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 16:32:12,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:12,417 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:12,418 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:12,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1631080167, now seen corresponding path program 1 times [2018-11-18 16:32:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:12,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:12,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:12,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:12,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-18 16:32:12,467 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:12,468 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:12,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:12,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:12,477 INFO L272 AbstractInterpreter]: Visited 46 different actions 50 times. Merged at 3 different actions 3 times. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 4. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:12,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:12,479 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:12,494 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 58.28% of their original sizes. [2018-11-18 16:32:12,494 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:12,539 INFO L415 sIntCurrentIteration]: We unified 69 AI predicates to 69 [2018-11-18 16:32:12,539 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:12,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:12,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-18 16:32:12,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:12,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:32:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:32:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:12,540 INFO L87 Difference]: Start difference. First operand 750 states and 1015 transitions. Second operand 12 states. [2018-11-18 16:32:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:13,134 INFO L93 Difference]: Finished difference Result 1835 states and 2498 transitions. [2018-11-18 16:32:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:32:13,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 16:32:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:13,156 INFO L225 Difference]: With dead ends: 1835 [2018-11-18 16:32:13,156 INFO L226 Difference]: Without dead ends: 1668 [2018-11-18 16:32:13,157 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-11-18 16:32:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 790. [2018-11-18 16:32:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-18 16:32:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1062 transitions. [2018-11-18 16:32:13,185 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1062 transitions. Word has length 70 [2018-11-18 16:32:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:13,185 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1062 transitions. [2018-11-18 16:32:13,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:32:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1062 transitions. [2018-11-18 16:32:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 16:32:13,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:13,187 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:13,187 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:13,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1037030752, now seen corresponding path program 1 times [2018-11-18 16:32:13,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:13,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:13,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:13,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:13,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-18 16:32:13,248 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:13,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:13,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:13,259 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:13,259 INFO L272 AbstractInterpreter]: Visited 46 different actions 51 times. Merged at 4 different actions 4 times. Never widened. Performed 164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:13,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:13,261 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:13,274 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 57.12% of their original sizes. [2018-11-18 16:32:13,274 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:13,322 INFO L415 sIntCurrentIteration]: We unified 69 AI predicates to 69 [2018-11-18 16:32:13,322 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:13,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:13,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-18 16:32:13,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:32:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:32:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:13,323 INFO L87 Difference]: Start difference. First operand 790 states and 1062 transitions. Second operand 12 states. [2018-11-18 16:32:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:14,330 INFO L93 Difference]: Finished difference Result 1706 states and 2319 transitions. [2018-11-18 16:32:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:32:14,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 16:32:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:14,333 INFO L225 Difference]: With dead ends: 1706 [2018-11-18 16:32:14,333 INFO L226 Difference]: Without dead ends: 1539 [2018-11-18 16:32:14,334 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2018-11-18 16:32:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 829. [2018-11-18 16:32:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-11-18 16:32:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1108 transitions. [2018-11-18 16:32:14,361 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1108 transitions. Word has length 70 [2018-11-18 16:32:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:14,361 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1108 transitions. [2018-11-18 16:32:14,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:32:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1108 transitions. [2018-11-18 16:32:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:32:14,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:14,363 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:14,363 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:14,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1726402211, now seen corresponding path program 1 times [2018-11-18 16:32:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:14,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:14,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:14,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:14,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:14,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-18 16:32:14,409 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:14,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:14,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:14,418 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:14,418 INFO L272 AbstractInterpreter]: Visited 47 different actions 52 times. Merged at 4 different actions 4 times. Never widened. Performed 165 root evaluator evaluations with a maximum evaluation depth of 4. Performed 165 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:14,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:14,420 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:14,433 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 61.31% of their original sizes. [2018-11-18 16:32:14,433 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:14,496 INFO L415 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-11-18 16:32:14,496 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-18 16:32:14,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:32:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:32:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:14,497 INFO L87 Difference]: Start difference. First operand 829 states and 1108 transitions. Second operand 12 states. [2018-11-18 16:32:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:15,026 INFO L93 Difference]: Finished difference Result 2066 states and 2810 transitions. [2018-11-18 16:32:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:32:15,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-18 16:32:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:15,030 INFO L225 Difference]: With dead ends: 2066 [2018-11-18 16:32:15,030 INFO L226 Difference]: Without dead ends: 1899 [2018-11-18 16:32:15,031 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:32:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2018-11-18 16:32:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 832. [2018-11-18 16:32:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 16:32:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1112 transitions. [2018-11-18 16:32:15,058 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1112 transitions. Word has length 71 [2018-11-18 16:32:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:15,059 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 1112 transitions. [2018-11-18 16:32:15,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:32:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1112 transitions. [2018-11-18 16:32:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:32:15,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:15,061 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:15,061 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:15,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1607324930, now seen corresponding path program 1 times [2018-11-18 16:32:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:15,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:32:15,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:15,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:15,107 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-18 16:32:15,107 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [117], [121], [124], [126], [128], [140], [150], [160], [163], [167], [169], [173], [175], [179], [181], [187], [193], [196], [198], [204], [208], [210], [215], [221], [225], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:15,108 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:15,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:15,119 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:15,119 INFO L272 AbstractInterpreter]: Visited 49 different actions 69 times. Merged at 10 different actions 14 times. Never widened. Performed 236 root evaluator evaluations with a maximum evaluation depth of 4. Performed 236 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:15,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:15,121 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:15,138 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 60.23% of their original sizes. [2018-11-18 16:32:15,139 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:15,203 INFO L415 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-11-18 16:32:15,203 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:15,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:15,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-11-18 16:32:15,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:15,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:32:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:32:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:32:15,204 INFO L87 Difference]: Start difference. First operand 832 states and 1112 transitions. Second operand 14 states. [2018-11-18 16:32:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:16,472 INFO L93 Difference]: Finished difference Result 1963 states and 2650 transitions. [2018-11-18 16:32:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:32:16,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 16:32:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:16,477 INFO L225 Difference]: With dead ends: 1963 [2018-11-18 16:32:16,477 INFO L226 Difference]: Without dead ends: 1796 [2018-11-18 16:32:16,477 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:32:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-11-18 16:32:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 832. [2018-11-18 16:32:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 16:32:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1112 transitions. [2018-11-18 16:32:16,526 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1112 transitions. Word has length 71 [2018-11-18 16:32:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:16,526 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 1112 transitions. [2018-11-18 16:32:16,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:32:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1112 transitions. [2018-11-18 16:32:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:32:16,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:16,528 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:16,528 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:16,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1878634623, now seen corresponding path program 1 times [2018-11-18 16:32:16,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:16,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:32:16,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:16,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:16,568 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-18 16:32:16,568 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [117], [121], [124], [126], [128], [140], [150], [160], [163], [167], [169], [173], [175], [179], [181], [187], [193], [196], [198], [204], [208], [210], [215], [221], [225], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:16,569 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:16,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:16,585 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:16,585 INFO L272 AbstractInterpreter]: Visited 49 different actions 69 times. Merged at 10 different actions 14 times. Never widened. Performed 236 root evaluator evaluations with a maximum evaluation depth of 4. Performed 236 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:16,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:16,600 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:16,624 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 59.43% of their original sizes. [2018-11-18 16:32:16,624 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:16,710 INFO L415 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-11-18 16:32:16,710 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-11-18 16:32:16,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:32:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:32:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:32:16,711 INFO L87 Difference]: Start difference. First operand 832 states and 1112 transitions. Second operand 14 states. [2018-11-18 16:32:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:18,204 INFO L93 Difference]: Finished difference Result 1818 states and 2450 transitions. [2018-11-18 16:32:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:32:18,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 16:32:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:18,207 INFO L225 Difference]: With dead ends: 1818 [2018-11-18 16:32:18,207 INFO L226 Difference]: Without dead ends: 1651 [2018-11-18 16:32:18,208 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:32:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-11-18 16:32:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 832. [2018-11-18 16:32:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 16:32:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1112 transitions. [2018-11-18 16:32:18,259 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1112 transitions. Word has length 71 [2018-11-18 16:32:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:18,259 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 1112 transitions. [2018-11-18 16:32:18,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:32:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1112 transitions. [2018-11-18 16:32:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:32:18,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:18,261 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:18,262 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:18,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1530706305, now seen corresponding path program 1 times [2018-11-18 16:32:18,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:18,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:18,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:18,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:18,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:18,334 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-18 16:32:18,335 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [54], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:18,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:18,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:18,347 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:18,348 INFO L272 AbstractInterpreter]: Visited 49 different actions 53 times. Merged at 3 different actions 3 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 4. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:18,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:18,361 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:18,382 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 61.96% of their original sizes. [2018-11-18 16:32:18,382 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:18,449 INFO L415 sIntCurrentIteration]: We unified 72 AI predicates to 72 [2018-11-18 16:32:18,449 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:18,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-18 16:32:18,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:18,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:32:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:32:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:18,451 INFO L87 Difference]: Start difference. First operand 832 states and 1112 transitions. Second operand 13 states. [2018-11-18 16:32:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:19,025 INFO L93 Difference]: Finished difference Result 2071 states and 2815 transitions. [2018-11-18 16:32:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:32:19,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-11-18 16:32:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:19,028 INFO L225 Difference]: With dead ends: 2071 [2018-11-18 16:32:19,028 INFO L226 Difference]: Without dead ends: 1904 [2018-11-18 16:32:19,029 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-11-18 16:32:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 832. [2018-11-18 16:32:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 16:32:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1112 transitions. [2018-11-18 16:32:19,080 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1112 transitions. Word has length 73 [2018-11-18 16:32:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:19,080 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 1112 transitions. [2018-11-18 16:32:19,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:32:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1112 transitions. [2018-11-18 16:32:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:32:19,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:19,082 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:19,082 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:19,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1649783586, now seen corresponding path program 1 times [2018-11-18 16:32:19,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:19,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:19,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:19,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:19,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:32:19,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:19,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:19,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-18 16:32:19,149 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [117], [121], [124], [126], [128], [140], [150], [160], [163], [167], [169], [173], [175], [179], [181], [187], [193], [196], [198], [204], [208], [210], [215], [221], [225], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:19,152 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:19,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:19,171 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:19,171 INFO L272 AbstractInterpreter]: Visited 51 different actions 75 times. Merged at 11 different actions 16 times. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 4. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 22 variables. [2018-11-18 16:32:19,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:19,181 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:19,205 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 60.82% of their original sizes. [2018-11-18 16:32:19,205 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:19,301 INFO L415 sIntCurrentIteration]: We unified 72 AI predicates to 72 [2018-11-18 16:32:19,301 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-11-18 16:32:19,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:19,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:32:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:32:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:32:19,302 INFO L87 Difference]: Start difference. First operand 832 states and 1112 transitions. Second operand 17 states. [2018-11-18 16:32:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:20,232 INFO L93 Difference]: Finished difference Result 1964 states and 2649 transitions. [2018-11-18 16:32:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:32:20,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-11-18 16:32:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:20,234 INFO L225 Difference]: With dead ends: 1964 [2018-11-18 16:32:20,234 INFO L226 Difference]: Without dead ends: 1797 [2018-11-18 16:32:20,235 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 16:32:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2018-11-18 16:32:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 874. [2018-11-18 16:32:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-18 16:32:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1163 transitions. [2018-11-18 16:32:20,272 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1163 transitions. Word has length 73 [2018-11-18 16:32:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:20,272 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1163 transitions. [2018-11-18 16:32:20,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:32:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1163 transitions. [2018-11-18 16:32:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:32:20,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:20,274 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:20,274 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:20,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash 173666721, now seen corresponding path program 1 times [2018-11-18 16:32:20,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:20,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:20,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:32:20,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:20,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:20,328 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-18 16:32:20,328 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [121], [124], [126], [128], [140], [150], [160], [169], [173], [181], [187], [193], [196], [198], [204], [208], [210], [215], [219], [221], [225], [227], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:20,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:20,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:20,344 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:32:20,344 INFO L272 AbstractInterpreter]: Visited 49 different actions 54 times. Merged at 4 different actions 4 times. Never widened. Performed 172 root evaluator evaluations with a maximum evaluation depth of 4. Performed 172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-18 16:32:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:20,347 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:32:20,366 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 61.96% of their original sizes. [2018-11-18 16:32:20,366 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:32:20,415 INFO L415 sIntCurrentIteration]: We unified 72 AI predicates to 72 [2018-11-18 16:32:20,415 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:32:20,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:20,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-18 16:32:20,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:20,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:32:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:32:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:20,416 INFO L87 Difference]: Start difference. First operand 874 states and 1163 transitions. Second operand 13 states. [2018-11-18 16:32:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:20,952 INFO L93 Difference]: Finished difference Result 2095 states and 2847 transitions. [2018-11-18 16:32:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:32:20,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-11-18 16:32:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:20,955 INFO L225 Difference]: With dead ends: 2095 [2018-11-18 16:32:20,955 INFO L226 Difference]: Without dead ends: 1928 [2018-11-18 16:32:20,956 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-11-18 16:32:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 874. [2018-11-18 16:32:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-18 16:32:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1163 transitions. [2018-11-18 16:32:20,987 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1163 transitions. Word has length 73 [2018-11-18 16:32:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:20,987 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1163 transitions. [2018-11-18 16:32:20,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:32:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1163 transitions. [2018-11-18 16:32:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:32:20,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:20,989 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:20,989 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:20,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash 382424443, now seen corresponding path program 1 times [2018-11-18 16:32:20,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:20,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:20,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:32:21,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:21,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:21,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-18 16:32:21,050 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [66], [70], [72], [75], [78], [80], [82], [94], [104], [114], [117], [121], [124], [126], [128], [140], [150], [160], [163], [167], [169], [173], [175], [179], [181], [187], [193], [196], [198], [204], [208], [210], [215], [221], [225], [233], [236], [238], [243], [245], [247], [249], [250], [255], [259], [275], [276], [277], [279] [2018-11-18 16:32:21,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:32:21,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:32:21,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:32:21,086 INFO L272 AbstractInterpreter]: Visited 65 different actions 157 times. Merged at 41 different actions 73 times. Never widened. Performed 578 root evaluator evaluations with a maximum evaluation depth of 4. Performed 578 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 16 fixpoints after 10 different actions. Largest state had 22 variables. [2018-11-18 16:32:21,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:21,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:32:21,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:21,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:32:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:21,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:32:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:21,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:32:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:32:21,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:32:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:32:21,298 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:32:21,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-11-18 16:32:21,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:21,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:21,299 INFO L87 Difference]: Start difference. First operand 874 states and 1163 transitions. Second operand 4 states. [2018-11-18 16:32:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:21,601 INFO L93 Difference]: Finished difference Result 1742 states and 2435 transitions. [2018-11-18 16:32:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:32:21,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-18 16:32:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:21,604 INFO L225 Difference]: With dead ends: 1742 [2018-11-18 16:32:21,604 INFO L226 Difference]: Without dead ends: 1106 [2018-11-18 16:32:21,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-11-18 16:32:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 987. [2018-11-18 16:32:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-11-18 16:32:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1262 transitions. [2018-11-18 16:32:21,669 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1262 transitions. Word has length 73 [2018-11-18 16:32:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:21,669 INFO L480 AbstractCegarLoop]: Abstraction has 987 states and 1262 transitions. [2018-11-18 16:32:21,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1262 transitions. [2018-11-18 16:32:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 16:32:21,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:21,671 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-18 16:32:21,671 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:21,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1192453737, now seen corresponding path program 1 times [2018-11-18 16:32:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:21,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 16:32:21,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:21,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:32:21,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:21,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:32:21,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:32:21,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:32:21,751 INFO L87 Difference]: Start difference. First operand 987 states and 1262 transitions. Second operand 3 states. [2018-11-18 16:32:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:21,829 INFO L93 Difference]: Finished difference Result 1028 states and 1312 transitions. [2018-11-18 16:32:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:32:21,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 16:32:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:21,831 INFO L225 Difference]: With dead ends: 1028 [2018-11-18 16:32:21,831 INFO L226 Difference]: Without dead ends: 960 [2018-11-18 16:32:21,832 INFO L604 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 [2018-11-18 16:32:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-11-18 16:32:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 929. [2018-11-18 16:32:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-11-18 16:32:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1183 transitions. [2018-11-18 16:32:21,889 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1183 transitions. Word has length 81 [2018-11-18 16:32:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:21,889 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 1183 transitions. [2018-11-18 16:32:21,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:32:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1183 transitions. [2018-11-18 16:32:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 16:32:21,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:21,891 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 16:32:21,891 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:21,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1610647093, now seen corresponding path program 1 times [2018-11-18 16:32:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:21,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 16:32:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:32:21,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:32:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:32:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:21,968 INFO L87 Difference]: Start difference. First operand 929 states and 1183 transitions. Second operand 4 states. [2018-11-18 16:32:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:22,138 INFO L93 Difference]: Finished difference Result 2180 states and 2820 transitions. [2018-11-18 16:32:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:32:22,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-18 16:32:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:22,140 INFO L225 Difference]: With dead ends: 2180 [2018-11-18 16:32:22,140 INFO L226 Difference]: Without dead ends: 1548 [2018-11-18 16:32:22,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:32:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2018-11-18 16:32:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1182. [2018-11-18 16:32:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-11-18 16:32:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1555 transitions. [2018-11-18 16:32:22,214 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1555 transitions. Word has length 87 [2018-11-18 16:32:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:22,214 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1555 transitions. [2018-11-18 16:32:22,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:32:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1555 transitions. [2018-11-18 16:32:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 16:32:22,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:22,216 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:32:22,216 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:22,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 581287795, now seen corresponding path program 2 times [2018-11-18 16:32:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:22,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:22,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:32:22,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:22,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:32:22,305 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:32:22,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:32:22,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:32:22,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5683bfcc-afc8-4239-b100-4a2ac6c44d41/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:32:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:32:22,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:32:22,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:32:22,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:32:22,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:32:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 16:32:22,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:32:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 16:32:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:32:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-11-18 16:32:22,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:32:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:32:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:32:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:32:22,477 INFO L87 Difference]: Start difference. First operand 1182 states and 1555 transitions. Second operand 8 states. [2018-11-18 16:32:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:23,167 INFO L93 Difference]: Finished difference Result 4293 states and 5507 transitions. [2018-11-18 16:32:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 16:32:23,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-18 16:32:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:23,171 INFO L225 Difference]: With dead ends: 4293 [2018-11-18 16:32:23,171 INFO L226 Difference]: Without dead ends: 3376 [2018-11-18 16:32:23,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-11-18 16:32:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2018-11-18 16:32:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 1435. [2018-11-18 16:32:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-11-18 16:32:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1948 transitions. [2018-11-18 16:32:23,228 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1948 transitions. Word has length 87 [2018-11-18 16:32:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:23,228 INFO L480 AbstractCegarLoop]: Abstraction has 1435 states and 1948 transitions. [2018-11-18 16:32:23,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:32:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1948 transitions. [2018-11-18 16:32:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 16:32:23,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:23,230 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:32:23,230 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:23,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1693291530, now seen corresponding path program 1 times [2018-11-18 16:32:23,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:23,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:23,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:32:23,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:23,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 16:32:23,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:23,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 16:32:23,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:23,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:32:23,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:32:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:32:23,299 INFO L87 Difference]: Start difference. First operand 1435 states and 1948 transitions. Second operand 7 states. [2018-11-18 16:32:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:23,730 INFO L93 Difference]: Finished difference Result 3422 states and 4704 transitions. [2018-11-18 16:32:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:32:23,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-18 16:32:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:23,733 INFO L225 Difference]: With dead ends: 3422 [2018-11-18 16:32:23,734 INFO L226 Difference]: Without dead ends: 2830 [2018-11-18 16:32:23,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2018-11-18 16:32:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2154. [2018-11-18 16:32:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2018-11-18 16:32:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2967 transitions. [2018-11-18 16:32:23,828 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2967 transitions. Word has length 91 [2018-11-18 16:32:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:23,828 INFO L480 AbstractCegarLoop]: Abstraction has 2154 states and 2967 transitions. [2018-11-18 16:32:23,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:32:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2967 transitions. [2018-11-18 16:32:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 16:32:23,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:23,831 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:32:23,831 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:23,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1322896811, now seen corresponding path program 1 times [2018-11-18 16:32:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:23,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 16:32:23,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:23,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:32:23,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:23,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:32:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:32:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:23,917 INFO L87 Difference]: Start difference. First operand 2154 states and 2967 transitions. Second operand 8 states. [2018-11-18 16:32:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:24,658 INFO L93 Difference]: Finished difference Result 4929 states and 6849 transitions. [2018-11-18 16:32:24,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 16:32:24,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-18 16:32:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:24,662 INFO L225 Difference]: With dead ends: 4929 [2018-11-18 16:32:24,662 INFO L226 Difference]: Without dead ends: 3682 [2018-11-18 16:32:24,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:32:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2018-11-18 16:32:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 2804. [2018-11-18 16:32:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2018-11-18 16:32:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3887 transitions. [2018-11-18 16:32:24,787 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3887 transitions. Word has length 94 [2018-11-18 16:32:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:24,787 INFO L480 AbstractCegarLoop]: Abstraction has 2804 states and 3887 transitions. [2018-11-18 16:32:24,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:32:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3887 transitions. [2018-11-18 16:32:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 16:32:24,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:24,790 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:32:24,791 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:24,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 326528789, now seen corresponding path program 1 times [2018-11-18 16:32:24,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:24,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:24,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 16:32:24,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:24,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:32:24,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:24,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:32:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:32:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:32:24,875 INFO L87 Difference]: Start difference. First operand 2804 states and 3887 transitions. Second operand 8 states. [2018-11-18 16:32:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:25,510 INFO L93 Difference]: Finished difference Result 8024 states and 11319 transitions. [2018-11-18 16:32:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:32:25,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-18 16:32:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:25,514 INFO L225 Difference]: With dead ends: 8024 [2018-11-18 16:32:25,515 INFO L226 Difference]: Without dead ends: 4316 [2018-11-18 16:32:25,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:32:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4316 states. [2018-11-18 16:32:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4316 to 3310. [2018-11-18 16:32:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2018-11-18 16:32:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4576 transitions. [2018-11-18 16:32:25,661 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4576 transitions. Word has length 94 [2018-11-18 16:32:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:25,662 INFO L480 AbstractCegarLoop]: Abstraction has 3310 states and 4576 transitions. [2018-11-18 16:32:25,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:32:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4576 transitions. [2018-11-18 16:32:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 16:32:25,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:25,664 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:32:25,664 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:25,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2076295601, now seen corresponding path program 1 times [2018-11-18 16:32:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:25,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:25,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 16:32:25,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:25,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:32:25,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:32:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:32:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:25,760 INFO L87 Difference]: Start difference. First operand 3310 states and 4576 transitions. Second operand 9 states. [2018-11-18 16:32:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:26,359 INFO L93 Difference]: Finished difference Result 4241 states and 5756 transitions. [2018-11-18 16:32:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:32:26,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 16:32:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:26,362 INFO L225 Difference]: With dead ends: 4241 [2018-11-18 16:32:26,363 INFO L226 Difference]: Without dead ends: 2963 [2018-11-18 16:32:26,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2018-11-18 16:32:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2655. [2018-11-18 16:32:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2018-11-18 16:32:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3646 transitions. [2018-11-18 16:32:26,469 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3646 transitions. Word has length 96 [2018-11-18 16:32:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:26,469 INFO L480 AbstractCegarLoop]: Abstraction has 2655 states and 3646 transitions. [2018-11-18 16:32:26,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:32:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3646 transitions. [2018-11-18 16:32:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 16:32:26,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:26,472 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:32:26,472 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:26,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1060798959, now seen corresponding path program 1 times [2018-11-18 16:32:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:26,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:26,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:32:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 16:32:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:32:26,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:32:26,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:32:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:32:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:32:26,580 INFO L87 Difference]: Start difference. First operand 2655 states and 3646 transitions. Second operand 9 states. [2018-11-18 16:32:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:32:27,182 INFO L93 Difference]: Finished difference Result 3380 states and 4595 transitions. [2018-11-18 16:32:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:32:27,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 16:32:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:32:27,183 INFO L225 Difference]: With dead ends: 3380 [2018-11-18 16:32:27,183 INFO L226 Difference]: Without dead ends: 1700 [2018-11-18 16:32:27,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:32:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2018-11-18 16:32:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1611. [2018-11-18 16:32:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-11-18 16:32:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2186 transitions. [2018-11-18 16:32:27,237 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2186 transitions. Word has length 96 [2018-11-18 16:32:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:32:27,237 INFO L480 AbstractCegarLoop]: Abstraction has 1611 states and 2186 transitions. [2018-11-18 16:32:27,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:32:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2186 transitions. [2018-11-18 16:32:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 16:32:27,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:32:27,238 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-18 16:32:27,238 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:32:27,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:32:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1775167391, now seen corresponding path program 1 times [2018-11-18 16:32:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:32:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:27,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:32:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:32:27,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:32:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:32:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:32:27,291 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:32:27,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:32:27 BoogieIcfgContainer [2018-11-18 16:32:27,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:32:27,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:32:27,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:32:27,337 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:32:27,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:32:00" (3/4) ... [2018-11-18 16:32:27,340 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:32:27,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:32:27,341 INFO L168 Benchmark]: Toolchain (without parser) took 27190.12 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 604.5 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -318.3 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:32:27,342 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:32:27,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:32:27,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:32:27,343 INFO L168 Benchmark]: Boogie Preprocessor took 69.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:32:27,343 INFO L168 Benchmark]: RCFGBuilder took 439.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:32:27,343 INFO L168 Benchmark]: TraceAbstraction took 26454.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.8 MB). Peak memory consumption was 292.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:32:27,344 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:32:27,346 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26454.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.8 MB). Peak memory consumption was 292.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL mp_add(a, b) VAL [\old(a)=0, \old(b)=2147483647] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L40] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L41] EXPR na - 1 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L42] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L43] EXPR na - 1 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L44] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L45] EXPR na - 1 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=1, r0=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 38 error locations. UNSAFE Result, 26.3s OverallTime, 41 OverallIterations, 5 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9926 SDtfs, 15738 SDslu, 35562 SDs, 0 SdLazy, 14699 SolverSat, 884 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 44 DeclaredPredicates, 1863 GetRequests, 1536 SyntacticMatches, 7 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3310occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 23 AbstIntIterations, 22 AbstIntStrong, 0.987703615070695 AbsIntWeakeningRatio, 0.5120174799708667 AbsIntAvgWeakeningVarsNumRemoved, 1.5462490895848506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 24995 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2811 NumberOfCodeBlocks, 2777 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2825 ConstructedInterpolants, 2 QuantifiedInterpolants, 559824 SizeOfPredicates, 3 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 18 PerfectInterpolantSequences, 1312/1444 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...