./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/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_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/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_f51fc656-73fd-4a24-8161-eb92b7b29c76/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-635dfa2 [2018-12-08 22:08:20,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:08:20,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:08:20,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:08:20,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:08:20,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:08:20,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:08:20,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:08:20,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:08:20,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:08:20,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:08:20,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:08:20,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:08:20,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:08:20,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:08:20,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:08:20,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:08:20,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:08:20,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:08:20,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:08:20,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:08:20,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:08:20,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:08:20,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:08:20,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:08:20,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:08:20,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:08:20,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:08:20,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:08:20,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:08:20,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:08:20,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:08:20,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:08:20,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:08:20,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:08:20,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:08:20,726 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-12-08 22:08:20,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:08:20,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:08:20,734 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:08:20,734 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:08:20,734 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 22:08:20,734 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 22:08:20,734 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 22:08:20,735 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 22:08:20,736 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:08:20,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 22:08:20,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:08:20,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:08:20,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:08:20,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:08:20,739 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 22:08:20,739 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_f51fc656-73fd-4a24-8161-eb92b7b29c76/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-12-08 22:08:20,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:08:20,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:08:20,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:08:20,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:08:20,770 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:08:20,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-12-08 22:08:20,816 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/data/c4fdb1717/0873488e485f40d0a2fdc8cdc30d96f7/FLAG67cc6e99d [2018-12-08 22:08:21,201 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:08:21,201 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-12-08 22:08:21,205 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/data/c4fdb1717/0873488e485f40d0a2fdc8cdc30d96f7/FLAG67cc6e99d [2018-12-08 22:08:21,213 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/bin-2019/utaipan/data/c4fdb1717/0873488e485f40d0a2fdc8cdc30d96f7 [2018-12-08 22:08:21,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:08:21,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:08:21,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:08:21,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:08:21,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:08:21,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21, skipping insertion in model container [2018-12-08 22:08:21,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:08:21,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:08:21,347 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:08:21,349 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:08:21,369 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:08:21,377 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:08:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21 WrapperNode [2018-12-08 22:08:21,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:08:21,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:08:21,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:08:21,378 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:08:21,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:08:21,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:08:21,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:08:21,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:08:21,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... [2018-12-08 22:08:21,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:08:21,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:08:21,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:08:21,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:08:21,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/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-12-08 22:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-08 22:08:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-08 22:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:08:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:08:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:08:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 22:08:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 22:08:21,678 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:08:21,678 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 22:08:21,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:21 BoogieIcfgContainer [2018-12-08 22:08:21,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:08:21,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:08:21,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:08:21,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:08:21,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:08:21" (1/3) ... [2018-12-08 22:08:21,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d798523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:08:21, skipping insertion in model container [2018-12-08 22:08:21,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:21" (2/3) ... [2018-12-08 22:08:21,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d798523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:08:21, skipping insertion in model container [2018-12-08 22:08:21,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:21" (3/3) ... [2018-12-08 22:08:21,683 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-12-08 22:08:21,689 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:08:21,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-12-08 22:08:21,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-12-08 22:08:21,724 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:08:21,724 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 22:08:21,724 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:08:21,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:08:21,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:08:21,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:08:21,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:08:21,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:08:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-12-08 22:08:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:08:21,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:21,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:08:21,743 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:21,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1025559455, now seen corresponding path program 1 times [2018-12-08 22:08:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:21,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:21,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:08:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-08 22:08:21,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:21,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 22:08:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 22:08:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 22:08:21,831 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-12-08 22:08:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:21,847 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2018-12-08 22:08:21,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 22:08:21,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-08 22:08:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:21,853 INFO L225 Difference]: With dead ends: 154 [2018-12-08 22:08:21,853 INFO L226 Difference]: Without dead ends: 74 [2018-12-08 22:08:21,855 INFO L631 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-12-08 22:08:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-08 22:08:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-08 22:08:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 22:08:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-12-08 22:08:21,878 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 9 [2018-12-08 22:08:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-12-08 22:08:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 22:08:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-12-08 22:08:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 22:08:21,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:21,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:08:21,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:21,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -133733111, now seen corresponding path program 1 times [2018-12-08 22:08:21,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:21,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:08:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:08:21,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:21,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:08:21,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:08:21,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:08:21,938 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 3 states. [2018-12-08 22:08:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:22,020 INFO L93 Difference]: Finished difference Result 150 states and 217 transitions. [2018-12-08 22:08:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:08:22,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-08 22:08:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:22,022 INFO L225 Difference]: With dead ends: 150 [2018-12-08 22:08:22,022 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 22:08:22,023 INFO L631 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-12-08 22:08:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 22:08:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-08 22:08:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 22:08:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-12-08 22:08:22,031 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 18 [2018-12-08 22:08:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:22,032 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-12-08 22:08:22,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:08:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-12-08 22:08:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 22:08:22,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:22,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:08:22,034 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:22,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash -375227645, now seen corresponding path program 1 times [2018-12-08 22:08:22,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:08:22,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:22,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:22,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:22,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:22,091 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 4 states. [2018-12-08 22:08:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:22,243 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2018-12-08 22:08:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:08:22,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-08 22:08:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:22,244 INFO L225 Difference]: With dead ends: 219 [2018-12-08 22:08:22,244 INFO L226 Difference]: Without dead ends: 172 [2018-12-08 22:08:22,244 INFO L631 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-12-08 22:08:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-08 22:08:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-12-08 22:08:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-08 22:08:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2018-12-08 22:08:22,250 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 25 [2018-12-08 22:08:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:22,250 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2018-12-08 22:08:22,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2018-12-08 22:08:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 22:08:22,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:22,251 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:22,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:22,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash -740983547, now seen corresponding path program 1 times [2018-12-08 22:08:22,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:22,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:22,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:22,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:22,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:22,310 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand 4 states. [2018-12-08 22:08:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:22,444 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2018-12-08 22:08:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:08:22,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-08 22:08:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:22,445 INFO L225 Difference]: With dead ends: 319 [2018-12-08 22:08:22,445 INFO L226 Difference]: Without dead ends: 227 [2018-12-08 22:08:22,446 INFO L631 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-12-08 22:08:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-08 22:08:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2018-12-08 22:08:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-08 22:08:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-12-08 22:08:22,453 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 32 [2018-12-08 22:08:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:22,453 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-12-08 22:08:22,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2018-12-08 22:08:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 22:08:22,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:22,454 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:22,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1838487559, now seen corresponding path program 1 times [2018-12-08 22:08:22,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 22:08:22,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:22,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:08:22,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:08:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:08:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:08:22,497 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand 5 states. [2018-12-08 22:08:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:22,657 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2018-12-08 22:08:22,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:08:22,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-08 22:08:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:22,658 INFO L225 Difference]: With dead ends: 460 [2018-12-08 22:08:22,659 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 22:08:22,659 INFO L631 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-12-08 22:08:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 22:08:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 176. [2018-12-08 22:08:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-08 22:08:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2018-12-08 22:08:22,666 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 39 [2018-12-08 22:08:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:22,667 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2018-12-08 22:08:22,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:08:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2018-12-08 22:08:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 22:08:22,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:22,668 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:22,668 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:22,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:22,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1692244499, now seen corresponding path program 1 times [2018-12-08 22:08:22,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 22:08:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:08:22,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:08:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:08:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:08:22,711 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand 5 states. [2018-12-08 22:08:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:22,883 INFO L93 Difference]: Finished difference Result 466 states and 649 transitions. [2018-12-08 22:08:22,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:08:22,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-08 22:08:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:22,884 INFO L225 Difference]: With dead ends: 466 [2018-12-08 22:08:22,884 INFO L226 Difference]: Without dead ends: 333 [2018-12-08 22:08:22,885 INFO L631 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-12-08 22:08:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-08 22:08:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 189. [2018-12-08 22:08:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-08 22:08:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2018-12-08 22:08:22,891 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 42 [2018-12-08 22:08:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:22,892 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2018-12-08 22:08:22,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:08:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2018-12-08 22:08:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 22:08:22,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:22,893 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:22,894 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -756319486, now seen corresponding path program 1 times [2018-12-08 22:08:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:22,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:22,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:22,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:22,945 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-08 22:08:22,946 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:22,967 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:22,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:23,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:23,042 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 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-12-08 22:08:23,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:23,047 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:23,085 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 56.33% of their original sizes. [2018-12-08 22:08:23,085 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:23,106 INFO L418 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-12-08 22:08:23,106 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:23,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-12-08 22:08:23,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:23,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:08:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:08:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:08:23,108 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand 7 states. [2018-12-08 22:08:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:23,660 INFO L93 Difference]: Finished difference Result 903 states and 1261 transitions. [2018-12-08 22:08:23,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:08:23,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-12-08 22:08:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:23,663 INFO L225 Difference]: With dead ends: 903 [2018-12-08 22:08:23,663 INFO L226 Difference]: Without dead ends: 770 [2018-12-08 22:08:23,664 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 39 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-12-08 22:08:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-12-08 22:08:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 194. [2018-12-08 22:08:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-08 22:08:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-12-08 22:08:23,673 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 45 [2018-12-08 22:08:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:23,674 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-12-08 22:08:23,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:08:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-12-08 22:08:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 22:08:23,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:23,675 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:23,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:23,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash -384403935, now seen corresponding path program 1 times [2018-12-08 22:08:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:23,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:23,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:23,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:23,721 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-08 22:08:23,721 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:23,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:23,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:23,732 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:23,732 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 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-12-08 22:08:23,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:23,734 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:23,749 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 62.46% of their original sizes. [2018-12-08 22:08:23,749 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:23,775 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-08 22:08:23,775 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-08 22:08:23,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:23,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:08:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:08:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:23,776 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 8 states. [2018-12-08 22:08:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:24,163 INFO L93 Difference]: Finished difference Result 1063 states and 1483 transitions. [2018-12-08 22:08:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:08:24,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-08 22:08:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:24,166 INFO L225 Difference]: With dead ends: 1063 [2018-12-08 22:08:24,166 INFO L226 Difference]: Without dead ends: 930 [2018-12-08 22:08:24,167 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 41 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-12-08 22:08:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-12-08 22:08:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 194. [2018-12-08 22:08:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-08 22:08:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-12-08 22:08:24,177 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 48 [2018-12-08 22:08:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:24,177 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-12-08 22:08:24,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:08:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-12-08 22:08:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 22:08:24,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:24,178 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:24,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:24,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 672452032, now seen corresponding path program 1 times [2018-12-08 22:08:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:24,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:24,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:24,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:24,224 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-08 22:08:24,224 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:24,225 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:24,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:24,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:24,231 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 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-12-08 22:08:24,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:24,232 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:24,245 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 59.51% of their original sizes. [2018-12-08 22:08:24,246 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:24,273 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-08 22:08:24,273 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-08 22:08:24,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:24,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:08:24,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:08:24,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:24,274 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 8 states. [2018-12-08 22:08:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:24,663 INFO L93 Difference]: Finished difference Result 1052 states and 1468 transitions. [2018-12-08 22:08:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:08:24,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-08 22:08:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:24,666 INFO L225 Difference]: With dead ends: 1052 [2018-12-08 22:08:24,666 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 22:08:24,667 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 41 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-12-08 22:08:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 22:08:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 202. [2018-12-08 22:08:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 22:08:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2018-12-08 22:08:24,678 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 48 [2018-12-08 22:08:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:24,679 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2018-12-08 22:08:24,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:08:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2018-12-08 22:08:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 22:08:24,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:24,680 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:24,680 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:24,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash -328370563, now seen corresponding path program 1 times [2018-12-08 22:08:24,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:24,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:24,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:24,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:24,725 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-08 22:08:24,725 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:24,726 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:24,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:24,732 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:24,732 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 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-12-08 22:08:24,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:24,733 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:24,743 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 64.13% of their original sizes. [2018-12-08 22:08:24,743 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:24,769 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-08 22:08:24,769 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:24,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:24,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-08 22:08:24,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:24,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:08:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:08:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:08:24,770 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand 9 states. [2018-12-08 22:08:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:25,245 INFO L93 Difference]: Finished difference Result 1066 states and 1486 transitions. [2018-12-08 22:08:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:08:25,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-08 22:08:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:25,247 INFO L225 Difference]: With dead ends: 1066 [2018-12-08 22:08:25,247 INFO L226 Difference]: Without dead ends: 933 [2018-12-08 22:08:25,248 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 42 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-12-08 22:08:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-08 22:08:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 197. [2018-12-08 22:08:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-08 22:08:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2018-12-08 22:08:25,255 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 50 [2018-12-08 22:08:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:25,256 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2018-12-08 22:08:25,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:08:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2018-12-08 22:08:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 22:08:25,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:25,256 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:25,257 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1569242044, now seen corresponding path program 1 times [2018-12-08 22:08:25,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:25,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:25,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:25,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:25,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:25,290 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-08 22:08:25,290 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:25,291 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:25,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:25,296 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:25,297 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 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-12-08 22:08:25,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:25,298 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:25,311 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.1% of their original sizes. [2018-12-08 22:08:25,312 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:25,332 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-08 22:08:25,332 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-08 22:08:25,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:08:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:08:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:08:25,333 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand 9 states. [2018-12-08 22:08:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:25,767 INFO L93 Difference]: Finished difference Result 1051 states and 1463 transitions. [2018-12-08 22:08:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:08:25,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-08 22:08:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:25,769 INFO L225 Difference]: With dead ends: 1051 [2018-12-08 22:08:25,769 INFO L226 Difference]: Without dead ends: 918 [2018-12-08 22:08:25,770 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 42 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-12-08 22:08:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-12-08 22:08:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 199. [2018-12-08 22:08:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 22:08:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2018-12-08 22:08:25,777 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 50 [2018-12-08 22:08:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:25,777 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2018-12-08 22:08:25,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:08:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2018-12-08 22:08:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 22:08:25,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:25,778 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:25,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:25,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -606991807, now seen corresponding path program 1 times [2018-12-08 22:08:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:25,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:25,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:25,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:25,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:25,812 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-08 22:08:25,813 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:25,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:25,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:25,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:25,819 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 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-12-08 22:08:25,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:25,820 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:25,831 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 64.64% of their original sizes. [2018-12-08 22:08:25,831 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:25,863 INFO L418 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-12-08 22:08:25,863 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:25,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:25,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-08 22:08:25,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:25,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:08:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:08:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:08:25,864 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand 9 states. [2018-12-08 22:08:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:26,288 INFO L93 Difference]: Finished difference Result 1201 states and 1675 transitions. [2018-12-08 22:08:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:08:26,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-12-08 22:08:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:26,290 INFO L225 Difference]: With dead ends: 1201 [2018-12-08 22:08:26,290 INFO L226 Difference]: Without dead ends: 1068 [2018-12-08 22:08:26,291 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 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-12-08 22:08:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-12-08 22:08:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 207. [2018-12-08 22:08:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-08 22:08:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2018-12-08 22:08:26,298 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 51 [2018-12-08 22:08:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:26,299 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2018-12-08 22:08:26,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:08:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2018-12-08 22:08:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 22:08:26,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:26,299 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:26,299 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:26,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1331615022, now seen corresponding path program 1 times [2018-12-08 22:08:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 22:08:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:08:26,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:08:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:08:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:08:26,330 INFO L87 Difference]: Start difference. First operand 207 states and 281 transitions. Second operand 3 states. [2018-12-08 22:08:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:26,340 INFO L93 Difference]: Finished difference Result 264 states and 361 transitions. [2018-12-08 22:08:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:08:26,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-08 22:08:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:26,341 INFO L225 Difference]: With dead ends: 264 [2018-12-08 22:08:26,341 INFO L226 Difference]: Without dead ends: 234 [2018-12-08 22:08:26,342 INFO L631 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-12-08 22:08:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-08 22:08:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-08 22:08:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-08 22:08:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2018-12-08 22:08:26,348 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 51 [2018-12-08 22:08:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:26,348 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2018-12-08 22:08:26,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:08:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-12-08 22:08:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 22:08:26,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:26,349 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:26,349 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 822141932, now seen corresponding path program 1 times [2018-12-08 22:08:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:08:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:26,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:26,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:26,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:26,396 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand 4 states. [2018-12-08 22:08:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:26,469 INFO L93 Difference]: Finished difference Result 588 states and 825 transitions. [2018-12-08 22:08:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:08:26,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-08 22:08:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:26,471 INFO L225 Difference]: With dead ends: 588 [2018-12-08 22:08:26,471 INFO L226 Difference]: Without dead ends: 425 [2018-12-08 22:08:26,471 INFO L631 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-12-08 22:08:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-08 22:08:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 363. [2018-12-08 22:08:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-08 22:08:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2018-12-08 22:08:26,486 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 51 [2018-12-08 22:08:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:26,486 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2018-12-08 22:08:26,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2018-12-08 22:08:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 22:08:26,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:26,487 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:26,487 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:26,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1939291061, now seen corresponding path program 1 times [2018-12-08 22:08:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 22:08:26,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:26,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:26,550 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-08 22:08:26,550 INFO L205 CegarAbsIntRunner]: [0], [29], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [162], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:26,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:26,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:26,555 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:26,556 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 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-12-08 22:08:26,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:26,557 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:26,565 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 43.78% of their original sizes. [2018-12-08 22:08:26,566 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:26,590 INFO L418 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-12-08 22:08:26,590 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-12-08 22:08:26,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:26,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:08:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:08:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:08:26,591 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 7 states. [2018-12-08 22:08:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:26,979 INFO L93 Difference]: Finished difference Result 993 states and 1388 transitions. [2018-12-08 22:08:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:08:26,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-08 22:08:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:26,981 INFO L225 Difference]: With dead ends: 993 [2018-12-08 22:08:26,981 INFO L226 Difference]: Without dead ends: 835 [2018-12-08 22:08:26,981 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 45 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-12-08 22:08:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-12-08 22:08:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 363. [2018-12-08 22:08:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-08 22:08:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2018-12-08 22:08:26,991 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 51 [2018-12-08 22:08:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:26,992 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2018-12-08 22:08:26,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:08:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2018-12-08 22:08:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 22:08:26,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:26,992 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:26,992 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:26,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2059084699, now seen corresponding path program 1 times [2018-12-08 22:08:26,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:26,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:26,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:26,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:27,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:27,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:27,022 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-08 22:08:27,022 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:27,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:27,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:27,027 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:27,027 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 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-12-08 22:08:27,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:27,030 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:27,043 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 65.79% of their original sizes. [2018-12-08 22:08:27,043 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:27,068 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-08 22:08:27,068 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:27,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-08 22:08:27,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:27,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:08:27,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:08:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:08:27,069 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 10 states. [2018-12-08 22:08:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:27,548 INFO L93 Difference]: Finished difference Result 1765 states and 2475 transitions. [2018-12-08 22:08:27,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:08:27,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-08 22:08:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:27,552 INFO L225 Difference]: With dead ends: 1765 [2018-12-08 22:08:27,552 INFO L226 Difference]: Without dead ends: 1605 [2018-12-08 22:08:27,553 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 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-12-08 22:08:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-12-08 22:08:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 355. [2018-12-08 22:08:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-08 22:08:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 491 transitions. [2018-12-08 22:08:27,577 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 491 transitions. Word has length 53 [2018-12-08 22:08:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:27,578 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 491 transitions. [2018-12-08 22:08:27,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:08:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 491 transitions. [2018-12-08 22:08:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 22:08:27,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:27,579 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:27,579 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:27,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1540842629, now seen corresponding path program 1 times [2018-12-08 22:08:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:27,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:27,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:27,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:27,623 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-08 22:08:27,624 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:27,624 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:27,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:27,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:27,630 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 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-12-08 22:08:27,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:27,632 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:27,641 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 65.79% of their original sizes. [2018-12-08 22:08:27,641 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:27,675 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-08 22:08:27,675 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:27,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:27,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-08 22:08:27,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:27,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:08:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:08:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:08:27,676 INFO L87 Difference]: Start difference. First operand 355 states and 491 transitions. Second operand 10 states. [2018-12-08 22:08:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:28,083 INFO L93 Difference]: Finished difference Result 1769 states and 2477 transitions. [2018-12-08 22:08:28,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:08:28,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-08 22:08:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:28,085 INFO L225 Difference]: With dead ends: 1769 [2018-12-08 22:08:28,085 INFO L226 Difference]: Without dead ends: 1609 [2018-12-08 22:08:28,086 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 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-12-08 22:08:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2018-12-08 22:08:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 355. [2018-12-08 22:08:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-08 22:08:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 491 transitions. [2018-12-08 22:08:28,098 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 491 transitions. Word has length 53 [2018-12-08 22:08:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:28,098 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 491 transitions. [2018-12-08 22:08:28,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:08:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 491 transitions. [2018-12-08 22:08:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 22:08:28,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:28,099 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:28,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:28,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2127317583, now seen corresponding path program 1 times [2018-12-08 22:08:28,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:28,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:08:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:28,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:28,135 INFO L87 Difference]: Start difference. First operand 355 states and 491 transitions. Second operand 4 states. [2018-12-08 22:08:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:28,230 INFO L93 Difference]: Finished difference Result 1032 states and 1468 transitions. [2018-12-08 22:08:28,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:08:28,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 22:08:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:28,231 INFO L225 Difference]: With dead ends: 1032 [2018-12-08 22:08:28,232 INFO L226 Difference]: Without dead ends: 734 [2018-12-08 22:08:28,232 INFO L631 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-12-08 22:08:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-08 22:08:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 637. [2018-12-08 22:08:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-12-08 22:08:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 886 transitions. [2018-12-08 22:08:28,246 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 886 transitions. Word has length 54 [2018-12-08 22:08:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:28,246 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 886 transitions. [2018-12-08 22:08:28,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 886 transitions. [2018-12-08 22:08:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 22:08:28,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:28,247 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:28,247 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:28,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1943944617, now seen corresponding path program 1 times [2018-12-08 22:08:28,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:08:28,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:28,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:28,282 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-08 22:08:28,282 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:28,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:28,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:28,287 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:28,287 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 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-12-08 22:08:28,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:28,290 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:28,301 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 66.71% of their original sizes. [2018-12-08 22:08:28,301 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:28,339 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-08 22:08:28,340 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:28,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:28,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-08 22:08:28,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:28,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:08:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:08:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:08:28,341 INFO L87 Difference]: Start difference. First operand 637 states and 886 transitions. Second operand 11 states. [2018-12-08 22:08:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:28,837 INFO L93 Difference]: Finished difference Result 1757 states and 2454 transitions. [2018-12-08 22:08:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:08:28,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-08 22:08:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:28,839 INFO L225 Difference]: With dead ends: 1757 [2018-12-08 22:08:28,839 INFO L226 Difference]: Without dead ends: 1597 [2018-12-08 22:08:28,840 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 45 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-12-08 22:08:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-12-08 22:08:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 621. [2018-12-08 22:08:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-12-08 22:08:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 865 transitions. [2018-12-08 22:08:28,856 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 865 transitions. Word has length 55 [2018-12-08 22:08:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:28,856 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 865 transitions. [2018-12-08 22:08:28,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:08:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 865 transitions. [2018-12-08 22:08:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 22:08:28,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:28,857 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:28,857 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:28,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2011291791, now seen corresponding path program 1 times [2018-12-08 22:08:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:28,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:28,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:28,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:28,905 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-12-08 22:08:28,906 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:28,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:28,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:28,926 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:28,927 INFO L272 AbstractInterpreter]: Visited 40 different actions 44 times. Merged at 3 different actions 3 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-12-08 22:08:28,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:28,930 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:28,948 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 51.28% of their original sizes. [2018-12-08 22:08:28,948 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:28,982 INFO L418 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-12-08 22:08:28,982 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:28,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:28,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-08 22:08:28,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:08:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:08:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:08:28,983 INFO L87 Difference]: Start difference. First operand 621 states and 865 transitions. Second operand 10 states. [2018-12-08 22:08:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:29,531 INFO L93 Difference]: Finished difference Result 1314 states and 1828 transitions. [2018-12-08 22:08:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:08:29,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-12-08 22:08:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:29,535 INFO L225 Difference]: With dead ends: 1314 [2018-12-08 22:08:29,535 INFO L226 Difference]: Without dead ends: 1156 [2018-12-08 22:08:29,536 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 51 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-12-08 22:08:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-12-08 22:08:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 667. [2018-12-08 22:08:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-12-08 22:08:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2018-12-08 22:08:29,567 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 60 [2018-12-08 22:08:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:29,567 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2018-12-08 22:08:29,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:08:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2018-12-08 22:08:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 22:08:29,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:29,568 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:29,568 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:29,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1571513232, now seen corresponding path program 1 times [2018-12-08 22:08:29,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:29,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:29,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:29,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:29,613 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 22:08:29,614 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:29,615 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:29,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:29,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:29,626 INFO L272 AbstractInterpreter]: Visited 43 different actions 47 times. Merged at 3 different actions 3 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-12-08 22:08:29,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:29,627 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:29,645 INFO L227 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 57.49% of their original sizes. [2018-12-08 22:08:29,646 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:29,694 INFO L418 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-12-08 22:08:29,694 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:29,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:29,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-08 22:08:29,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:29,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:08:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:08:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:08:29,695 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand 11 states. [2018-12-08 22:08:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:30,508 INFO L93 Difference]: Finished difference Result 1662 states and 2309 transitions. [2018-12-08 22:08:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:08:30,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-12-08 22:08:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:30,511 INFO L225 Difference]: With dead ends: 1662 [2018-12-08 22:08:30,511 INFO L226 Difference]: Without dead ends: 1504 [2018-12-08 22:08:30,512 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 53 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-12-08 22:08:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-12-08 22:08:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 667. [2018-12-08 22:08:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-12-08 22:08:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2018-12-08 22:08:30,546 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 63 [2018-12-08 22:08:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:30,547 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2018-12-08 22:08:30,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:08:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2018-12-08 22:08:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 22:08:30,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:30,548 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:30,548 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:30,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 787282449, now seen corresponding path program 1 times [2018-12-08 22:08:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:30,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:30,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:30,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:30,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:30,598 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 22:08:30,598 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:30,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:30,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:30,611 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:30,611 INFO L272 AbstractInterpreter]: Visited 43 different actions 47 times. Merged at 3 different actions 3 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-12-08 22:08:30,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:30,613 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:30,630 INFO L227 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 56.39% of their original sizes. [2018-12-08 22:08:30,631 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:30,674 INFO L418 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-12-08 22:08:30,674 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-08 22:08:30,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:30,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:08:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:08:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:08:30,676 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand 11 states. [2018-12-08 22:08:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:31,235 INFO L93 Difference]: Finished difference Result 1559 states and 2158 transitions. [2018-12-08 22:08:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:08:31,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-12-08 22:08:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:31,240 INFO L225 Difference]: With dead ends: 1559 [2018-12-08 22:08:31,240 INFO L226 Difference]: Without dead ends: 1401 [2018-12-08 22:08:31,241 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 53 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-12-08 22:08:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-12-08 22:08:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 675. [2018-12-08 22:08:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-12-08 22:08:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 932 transitions. [2018-12-08 22:08:31,273 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 932 transitions. Word has length 63 [2018-12-08 22:08:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:31,273 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 932 transitions. [2018-12-08 22:08:31,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:08:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 932 transitions. [2018-12-08 22:08:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 22:08:31,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:31,274 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:31,274 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:31,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:31,274 INFO L82 PathProgramCache]: Analyzing trace with hash 837913534, now seen corresponding path program 1 times [2018-12-08 22:08:31,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:31,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:31,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:31,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:31,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:08:31,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:31,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:31,312 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 22:08:31,312 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [116], [120], [123], [125], [127], [139], [149], [159], [162], [166], [168], [172], [174], [178], [180], [186], [192], [195], [197], [206], [208], [213], [219], [223], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:31,313 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:31,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:31,328 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:31,329 INFO L272 AbstractInterpreter]: Visited 45 different actions 63 times. Merged at 9 different actions 12 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-12-08 22:08:31,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:31,330 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:31,346 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 55.18% of their original sizes. [2018-12-08 22:08:31,347 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:31,394 INFO L418 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-12-08 22:08:31,395 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:31,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:31,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-12-08 22:08:31,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:31,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 22:08:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 22:08:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 22:08:31,395 INFO L87 Difference]: Start difference. First operand 675 states and 932 transitions. Second operand 13 states. [2018-12-08 22:08:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:32,327 INFO L93 Difference]: Finished difference Result 1463 states and 2005 transitions. [2018-12-08 22:08:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 22:08:32,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-08 22:08:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:32,329 INFO L225 Difference]: With dead ends: 1463 [2018-12-08 22:08:32,329 INFO L226 Difference]: Without dead ends: 1305 [2018-12-08 22:08:32,330 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 51 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-12-08 22:08:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-12-08 22:08:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 719. [2018-12-08 22:08:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-08 22:08:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 984 transitions. [2018-12-08 22:08:32,349 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 984 transitions. Word has length 63 [2018-12-08 22:08:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:32,349 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 984 transitions. [2018-12-08 22:08:32,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 22:08:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 984 transitions. [2018-12-08 22:08:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 22:08:32,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:32,350 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:32,350 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:32,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1910513588, now seen corresponding path program 1 times [2018-12-08 22:08:32,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:32,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:32,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:32,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:32,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-08 22:08:32,379 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:32,380 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:32,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:32,390 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:32,391 INFO L272 AbstractInterpreter]: Visited 45 different actions 48 times. Merged at 2 different actions 2 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-12-08 22:08:32,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:32,394 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:32,406 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 58.43% of their original sizes. [2018-12-08 22:08:32,406 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:32,449 INFO L418 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-12-08 22:08:32,449 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:32,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:32,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-12-08 22:08:32,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:32,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 22:08:32,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 22:08:32,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 22:08:32,450 INFO L87 Difference]: Start difference. First operand 719 states and 984 transitions. Second operand 12 states. [2018-12-08 22:08:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:33,084 INFO L93 Difference]: Finished difference Result 1748 states and 2411 transitions. [2018-12-08 22:08:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 22:08:33,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-08 22:08:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:33,088 INFO L225 Difference]: With dead ends: 1748 [2018-12-08 22:08:33,089 INFO L226 Difference]: Without dead ends: 1590 [2018-12-08 22:08:33,089 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 54 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-12-08 22:08:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-12-08 22:08:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 757. [2018-12-08 22:08:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-12-08 22:08:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1029 transitions. [2018-12-08 22:08:33,136 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1029 transitions. Word has length 65 [2018-12-08 22:08:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 1029 transitions. [2018-12-08 22:08:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 22:08:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1029 transitions. [2018-12-08 22:08:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 22:08:33,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:33,137 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:33,137 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:33,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash -272225523, now seen corresponding path program 1 times [2018-12-08 22:08:33,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:33,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:33,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:33,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:33,188 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-08 22:08:33,189 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:33,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:33,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:33,197 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:33,197 INFO L272 AbstractInterpreter]: Visited 45 different actions 49 times. Merged at 3 different actions 3 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-12-08 22:08:33,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:33,198 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:33,210 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 57.2% of their original sizes. [2018-12-08 22:08:33,210 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:33,252 INFO L418 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-12-08 22:08:33,252 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:33,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:33,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-12-08 22:08:33,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:33,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 22:08:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 22:08:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 22:08:33,253 INFO L87 Difference]: Start difference. First operand 757 states and 1029 transitions. Second operand 12 states. [2018-12-08 22:08:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:34,118 INFO L93 Difference]: Finished difference Result 1626 states and 2239 transitions. [2018-12-08 22:08:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 22:08:34,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-08 22:08:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:34,121 INFO L225 Difference]: With dead ends: 1626 [2018-12-08 22:08:34,121 INFO L226 Difference]: Without dead ends: 1468 [2018-12-08 22:08:34,121 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 54 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-12-08 22:08:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-08 22:08:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 794. [2018-12-08 22:08:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-12-08 22:08:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1073 transitions. [2018-12-08 22:08:34,144 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1073 transitions. Word has length 65 [2018-12-08 22:08:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1073 transitions. [2018-12-08 22:08:34,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 22:08:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1073 transitions. [2018-12-08 22:08:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 22:08:34,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:34,145 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:34,145 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:34,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1005515920, now seen corresponding path program 1 times [2018-12-08 22:08:34,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:34,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:08:34,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:34,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:34,185 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-08 22:08:34,185 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:34,186 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:34,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:34,197 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 22:08:34,197 INFO L272 AbstractInterpreter]: Visited 46 different actions 50 times. Merged at 3 different actions 3 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-12-08 22:08:34,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:34,198 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 22:08:34,210 INFO L227 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 61.38% of their original sizes. [2018-12-08 22:08:34,210 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 22:08:34,261 INFO L418 sIntCurrentIteration]: We unified 65 AI predicates to 65 [2018-12-08 22:08:34,261 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 22:08:34,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:34,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-12-08 22:08:34,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:34,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 22:08:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 22:08:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 22:08:34,262 INFO L87 Difference]: Start difference. First operand 794 states and 1073 transitions. Second operand 12 states. [2018-12-08 22:08:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:34,688 INFO L93 Difference]: Finished difference Result 1968 states and 2712 transitions. [2018-12-08 22:08:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 22:08:34,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-08 22:08:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:34,690 INFO L225 Difference]: With dead ends: 1968 [2018-12-08 22:08:34,690 INFO L226 Difference]: Without dead ends: 1810 [2018-12-08 22:08:34,691 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 55 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-12-08 22:08:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2018-12-08 22:08:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 797. [2018-12-08 22:08:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-08 22:08:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1077 transitions. [2018-12-08 22:08:34,714 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1077 transitions. Word has length 66 [2018-12-08 22:08:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1077 transitions. [2018-12-08 22:08:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 22:08:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1077 transitions. [2018-12-08 22:08:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 22:08:34,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:34,715 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 22:08:34,715 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:34,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash -954884835, now seen corresponding path program 1 times [2018-12-08 22:08:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:34,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:08:34,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:34,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:34,749 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-08 22:08:34,749 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [116], [120], [123], [125], [127], [139], [149], [159], [162], [166], [168], [172], [174], [178], [180], [186], [192], [195], [197], [206], [208], [213], [219], [223], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-12-08 22:08:34,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:08:34,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:08:34,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 22:08:34,775 INFO L272 AbstractInterpreter]: Visited 61 different actions 126 times. Merged at 27 different actions 50 times. Never widened. Performed 478 root evaluator evaluations with a maximum evaluation depth of 4. Performed 478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 9 different actions. Largest state had 22 variables. [2018-12-08 22:08:34,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:34,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 22:08:34,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:34,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/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-12-08 22:08:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:34,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 22:08:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:34,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:08:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 22:08:34,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:08:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 22:08:34,890 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 22:08:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-12-08 22:08:34,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:34,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:34,891 INFO L87 Difference]: Start difference. First operand 797 states and 1077 transitions. Second operand 4 states. [2018-12-08 22:08:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:35,258 INFO L93 Difference]: Finished difference Result 1633 states and 2317 transitions. [2018-12-08 22:08:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:08:35,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 22:08:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:35,260 INFO L225 Difference]: With dead ends: 1633 [2018-12-08 22:08:35,260 INFO L226 Difference]: Without dead ends: 1020 [2018-12-08 22:08:35,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-12-08 22:08:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 904. [2018-12-08 22:08:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 22:08:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1170 transitions. [2018-12-08 22:08:35,290 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1170 transitions. Word has length 66 [2018-12-08 22:08:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:35,290 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1170 transitions. [2018-12-08 22:08:35,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1170 transitions. [2018-12-08 22:08:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 22:08:35,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:35,291 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:35,291 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:35,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash -183029461, now seen corresponding path program 1 times [2018-12-08 22:08:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 22:08:35,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:35,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 22:08:35,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:35,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:08:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:08:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:08:35,332 INFO L87 Difference]: Start difference. First operand 904 states and 1170 transitions. Second operand 3 states. [2018-12-08 22:08:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:35,360 INFO L93 Difference]: Finished difference Result 941 states and 1216 transitions. [2018-12-08 22:08:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:08:35,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-08 22:08:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:35,362 INFO L225 Difference]: With dead ends: 941 [2018-12-08 22:08:35,362 INFO L226 Difference]: Without dead ends: 880 [2018-12-08 22:08:35,362 INFO L631 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-12-08 22:08:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2018-12-08 22:08:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 854. [2018-12-08 22:08:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-12-08 22:08:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1101 transitions. [2018-12-08 22:08:35,388 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1101 transitions. Word has length 73 [2018-12-08 22:08:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:35,388 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1101 transitions. [2018-12-08 22:08:35,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:08:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1101 transitions. [2018-12-08 22:08:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 22:08:35,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:35,389 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:35,389 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:35,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -277234447, now seen corresponding path program 1 times [2018-12-08 22:08:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 22:08:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:35,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:35,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:35,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:35,420 INFO L87 Difference]: Start difference. First operand 854 states and 1101 transitions. Second operand 4 states. [2018-12-08 22:08:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:35,551 INFO L93 Difference]: Finished difference Result 2020 states and 2648 transitions. [2018-12-08 22:08:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:08:35,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 22:08:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:35,554 INFO L225 Difference]: With dead ends: 2020 [2018-12-08 22:08:35,554 INFO L226 Difference]: Without dead ends: 1410 [2018-12-08 22:08:35,555 INFO L631 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-12-08 22:08:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2018-12-08 22:08:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1096. [2018-12-08 22:08:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-12-08 22:08:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1460 transitions. [2018-12-08 22:08:35,595 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1460 transitions. Word has length 79 [2018-12-08 22:08:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:35,595 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1460 transitions. [2018-12-08 22:08:35,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:08:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1460 transitions. [2018-12-08 22:08:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 22:08:35,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:35,597 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:35,597 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:35,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:35,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1773749551, now seen corresponding path program 2 times [2018-12-08 22:08:35,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:35,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 22:08:35,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:35,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:08:35,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 22:08:35,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 22:08:35,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:08:35,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f51fc656-73fd-4a24-8161-eb92b7b29c76/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-12-08 22:08:35,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 22:08:35,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 22:08:35,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 22:08:35,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 22:08:35,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:08:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 22:08:35,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:08:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 22:08:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 22:08:35,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-12-08 22:08:35,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 22:08:35,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:08:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:08:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:08:35,774 INFO L87 Difference]: Start difference. First operand 1096 states and 1460 transitions. Second operand 8 states. [2018-12-08 22:08:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:36,422 INFO L93 Difference]: Finished difference Result 4072 states and 5274 transitions. [2018-12-08 22:08:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:08:36,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-08 22:08:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:36,426 INFO L225 Difference]: With dead ends: 4072 [2018-12-08 22:08:36,426 INFO L226 Difference]: Without dead ends: 3190 [2018-12-08 22:08:36,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-12-08 22:08:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-12-08 22:08:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 1341. [2018-12-08 22:08:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-08 22:08:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1845 transitions. [2018-12-08 22:08:36,476 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1845 transitions. Word has length 79 [2018-12-08 22:08:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:36,476 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 1845 transitions. [2018-12-08 22:08:36,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:08:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1845 transitions. [2018-12-08 22:08:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 22:08:36,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:36,477 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:36,477 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:36,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash 315577703, now seen corresponding path program 1 times [2018-12-08 22:08:36,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:36,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:08:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:36,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:08:36,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:36,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:08:36,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:36,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:08:36,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:08:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:08:36,537 INFO L87 Difference]: Start difference. First operand 1341 states and 1845 transitions. Second operand 7 states. [2018-12-08 22:08:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:37,360 INFO L93 Difference]: Finished difference Result 3232 states and 4498 transitions. [2018-12-08 22:08:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:08:37,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-08 22:08:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:37,363 INFO L225 Difference]: With dead ends: 3232 [2018-12-08 22:08:37,363 INFO L226 Difference]: Without dead ends: 2661 [2018-12-08 22:08:37,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 22:08:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-12-08 22:08:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 1992. [2018-12-08 22:08:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2018-12-08 22:08:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2789 transitions. [2018-12-08 22:08:37,429 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2789 transitions. Word has length 85 [2018-12-08 22:08:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:37,430 INFO L480 AbstractCegarLoop]: Abstraction has 1992 states and 2789 transitions. [2018-12-08 22:08:37,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:08:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2789 transitions. [2018-12-08 22:08:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 22:08:37,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:37,431 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:37,431 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:37,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1216906630, now seen corresponding path program 1 times [2018-12-08 22:08:37,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:37,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:37,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:08:37,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:08:37,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:37,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:08:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:08:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:37,517 INFO L87 Difference]: Start difference. First operand 1992 states and 2789 transitions. Second operand 8 states. [2018-12-08 22:08:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:38,143 INFO L93 Difference]: Finished difference Result 4666 states and 6569 transitions. [2018-12-08 22:08:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 22:08:38,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-08 22:08:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:38,147 INFO L225 Difference]: With dead ends: 4666 [2018-12-08 22:08:38,147 INFO L226 Difference]: Without dead ends: 3463 [2018-12-08 22:08:38,148 INFO L631 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-12-08 22:08:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2018-12-08 22:08:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 2630. [2018-12-08 22:08:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-12-08 22:08:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3697 transitions. [2018-12-08 22:08:38,244 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3697 transitions. Word has length 88 [2018-12-08 22:08:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:38,245 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 3697 transitions. [2018-12-08 22:08:38,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:08:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3697 transitions. [2018-12-08 22:08:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 22:08:38,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:38,246 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:38,246 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:38,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1107684138, now seen corresponding path program 1 times [2018-12-08 22:08:38,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:38,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:38,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:08:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:38,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:08:38,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:08:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:08:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:08:38,318 INFO L87 Difference]: Start difference. First operand 2630 states and 3697 transitions. Second operand 8 states. [2018-12-08 22:08:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:38,992 INFO L93 Difference]: Finished difference Result 7663 states and 10942 transitions. [2018-12-08 22:08:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 22:08:38,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-08 22:08:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:39,004 INFO L225 Difference]: With dead ends: 7663 [2018-12-08 22:08:39,004 INFO L226 Difference]: Without dead ends: 4099 [2018-12-08 22:08:39,009 INFO L631 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-12-08 22:08:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-12-08 22:08:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 3115. [2018-12-08 22:08:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-12-08 22:08:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4365 transitions. [2018-12-08 22:08:39,153 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4365 transitions. Word has length 88 [2018-12-08 22:08:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:39,153 INFO L480 AbstractCegarLoop]: Abstraction has 3115 states and 4365 transitions. [2018-12-08 22:08:39,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:08:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4365 transitions. [2018-12-08 22:08:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 22:08:39,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:39,155 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:39,155 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:39,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1919875554, now seen corresponding path program 1 times [2018-12-08 22:08:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:39,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:39,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:08:39,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:08:39,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:39,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:08:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:08:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:08:39,250 INFO L87 Difference]: Start difference. First operand 3115 states and 4365 transitions. Second operand 9 states. [2018-12-08 22:08:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:39,778 INFO L93 Difference]: Finished difference Result 4003 states and 5502 transitions. [2018-12-08 22:08:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:08:39,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-12-08 22:08:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:39,781 INFO L225 Difference]: With dead ends: 4003 [2018-12-08 22:08:39,781 INFO L226 Difference]: Without dead ends: 2823 [2018-12-08 22:08:39,782 INFO L631 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-12-08 22:08:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2018-12-08 22:08:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2520. [2018-12-08 22:08:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2520 states. [2018-12-08 22:08:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3504 transitions. [2018-12-08 22:08:39,867 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3504 transitions. Word has length 90 [2018-12-08 22:08:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:39,867 INFO L480 AbstractCegarLoop]: Abstraction has 2520 states and 3504 transitions. [2018-12-08 22:08:39,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:08:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3504 transitions. [2018-12-08 22:08:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 22:08:39,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:39,868 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:39,869 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:39,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1198243630, now seen corresponding path program 1 times [2018-12-08 22:08:39,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:39,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:39,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:08:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:39,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:08:39,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:08:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:08:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:08:39,940 INFO L87 Difference]: Start difference. First operand 2520 states and 3504 transitions. Second operand 9 states. [2018-12-08 22:08:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:40,588 INFO L93 Difference]: Finished difference Result 3205 states and 4413 transitions. [2018-12-08 22:08:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:08:40,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-12-08 22:08:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:08:40,590 INFO L225 Difference]: With dead ends: 3205 [2018-12-08 22:08:40,590 INFO L226 Difference]: Without dead ends: 1627 [2018-12-08 22:08:40,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-08 22:08:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-12-08 22:08:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1541. [2018-12-08 22:08:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2018-12-08 22:08:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2116 transitions. [2018-12-08 22:08:40,640 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2116 transitions. Word has length 90 [2018-12-08 22:08:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:08:40,640 INFO L480 AbstractCegarLoop]: Abstraction has 1541 states and 2116 transitions. [2018-12-08 22:08:40,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:08:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2116 transitions. [2018-12-08 22:08:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 22:08:40,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:40,641 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 22:08:40,641 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 22:08:40,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2132168340, now seen corresponding path program 1 times [2018-12-08 22:08:40,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:40,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:40,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:08:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:08:40,675 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:08:40,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:08:40 BoogieIcfgContainer [2018-12-08 22:08:40,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:08:40,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:08:40,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:08:40,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:08:40,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:21" (3/4) ... [2018-12-08 22:08:40,713 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:08:40,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:08:40,713 INFO L168 Benchmark]: Toolchain (without parser) took 19498.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 948.6 MB in the beginning and 916.3 MB in the end (delta: 32.3 MB). Peak memory consumption was 408.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,714 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:08:40,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 935.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,715 INFO L168 Benchmark]: Boogie Preprocessor took 18.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,715 INFO L168 Benchmark]: RCFGBuilder took 240.30 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,715 INFO L168 Benchmark]: TraceAbstraction took 19030.78 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 268.4 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 159.3 MB). Peak memory consumption was 427.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:08:40,715 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.4 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:08:40,717 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 935.2 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 41.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 240.30 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19030.78 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 268.4 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 159.3 MB). Peak memory consumption was 427.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.4 GB. Free memory is still 916.3 MB. 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, 126 locations, 38 error locations. UNSAFE Result, 18.9s OverallTime, 36 OverallIterations, 4 TraceHistogramMax, 14.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7862 SDtfs, 12445 SDslu, 26472 SDs, 0 SdLazy, 11062 SolverSat, 721 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 34 DeclaredPredicates, 1386 GetRequests, 1126 SyntacticMatches, 7 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3115occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 18 AbstIntIterations, 17 AbstIntStrong, 0.9869894917909937 AbsIntWeakeningRatio, 0.5761802575107297 AbsIntAvgWeakeningVarsNumRemoved, 1.4645922746781115 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 19205 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2223 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2259 ConstructedInterpolants, 1 QuantifiedInterpolants, 402005 SizeOfPredicates, 3 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 1049/1143 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...