./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer --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 Automizer --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_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:20:59,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:20:59,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:20:59,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:20:59,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:20:59,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:20:59,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:20:59,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:20:59,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:20:59,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:20:59,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:20:59,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:20:59,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:20:59,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:20:59,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:20:59,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:20:59,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:20:59,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:20:59,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:20:59,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:20:59,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:20:59,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:20:59,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:20:59,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:20:59,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:20:59,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:20:59,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:20:59,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:20:59,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:20:59,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:20:59,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:20:59,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:20:59,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:20:59,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:20:59,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:20:59,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:20:59,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-18 12:20:59,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:20:59,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:20:59,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:20:59,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 12:20:59,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:20:59,544 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:20:59,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:20:59,545 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:20:59,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:20:59,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:20:59,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:20:59,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:20:59,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:20:59,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:20:59,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:20:59,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6af52310ec13e6e7a94146d05f9e904086453aae [2018-11-18 12:20:59,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:20:59,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:20:59,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:20:59,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:20:59,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:20:59,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-18 12:20:59,619 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/data/85a18da90/143a18fb4423424c80ccea009564bbc6/FLAGd15e9fa0d [2018-11-18 12:21:00,026 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:00,026 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-18 12:21:00,032 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/data/85a18da90/143a18fb4423424c80ccea009564bbc6/FLAGd15e9fa0d [2018-11-18 12:21:00,041 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/data/85a18da90/143a18fb4423424c80ccea009564bbc6 [2018-11-18 12:21:00,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:00,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:21:00,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:00,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:00,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:00,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00, skipping insertion in model container [2018-11-18 12:21:00,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:00,074 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:00,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:00,208 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:00,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:00,246 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:00,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00 WrapperNode [2018-11-18 12:21:00,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:00,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:00,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:00,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:00,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... [2018-11-18 12:21:00,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:00,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:00,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:00,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:00,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:21:00,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:21:00,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:00,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 12:21:00,346 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 12:21:00,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-18 12:21:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-18 12:21:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 12:21:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:21:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:21:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:00,660 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:00,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:00 BoogieIcfgContainer [2018-11-18 12:21:00,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:00,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:21:00,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:21:00,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:21:00,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:21:00" (1/3) ... [2018-11-18 12:21:00,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc55a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:00, skipping insertion in model container [2018-11-18 12:21:00,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:00" (2/3) ... [2018-11-18 12:21:00,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc55a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:00, skipping insertion in model container [2018-11-18 12:21:00,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:00" (3/3) ... [2018-11-18 12:21:00,666 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-11-18 12:21:00,672 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:21:00,676 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-18 12:21:00,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-18 12:21:00,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:21:00,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:21:00,707 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:21:00,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:21:00,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:00,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:00,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:21:00,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:00,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:21:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 12:21:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 12:21:00,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:00,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:00,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:00,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-11-18 12:21:00,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:00,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:00,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:00,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 12:21:00,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 12:21:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:21:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:00,838 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-18 12:21:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:00,856 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-18 12:21:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:21:00,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-18 12:21:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:00,863 INFO L225 Difference]: With dead ends: 157 [2018-11-18 12:21:00,863 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 12:21:00,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 12:21:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-18 12:21:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 12:21:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-18 12:21:00,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-18 12:21:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:00,890 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-18 12:21:00,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 12:21:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-18 12:21:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 12:21:00,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:00,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:00,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:00,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-11-18 12:21:00,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:00,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:00,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:00,993 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-18 12:21:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:01,161 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-18 12:21:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:01,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 12:21:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:01,162 INFO L225 Difference]: With dead ends: 156 [2018-11-18 12:21:01,162 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 12:21:01,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 12:21:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-18 12:21:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 12:21:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-18 12:21:01,169 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-18 12:21:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:01,169 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-18 12:21:01,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-18 12:21:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 12:21:01,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:01,170 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:01,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-11-18 12:21:01,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:01,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:01,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:01,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:21:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:21:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:21:01,252 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-18 12:21:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:01,503 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2018-11-18 12:21:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:21:01,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 12:21:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:01,506 INFO L225 Difference]: With dead ends: 227 [2018-11-18 12:21:01,506 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 12:21:01,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 12:21:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2018-11-18 12:21:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 12:21:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2018-11-18 12:21:01,517 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 28 [2018-11-18 12:21:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:01,517 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2018-11-18 12:21:01,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:21:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-18 12:21:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 12:21:01,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:01,519 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:01,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:01,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-11-18 12:21:01,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:01,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 12:21:01,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:01,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:21:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:21:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:21:01,579 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand 4 states. [2018-11-18 12:21:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:01,729 INFO L93 Difference]: Finished difference Result 331 states and 464 transitions. [2018-11-18 12:21:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:21:01,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 12:21:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:01,732 INFO L225 Difference]: With dead ends: 331 [2018-11-18 12:21:01,732 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 12:21:01,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 12:21:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 171. [2018-11-18 12:21:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 12:21:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2018-11-18 12:21:01,744 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 36 [2018-11-18 12:21:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:01,744 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2018-11-18 12:21:01,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:21:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2018-11-18 12:21:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 12:21:01,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:01,746 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:01,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:01,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-11-18 12:21:01,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 12:21:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:21:01,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:01,821 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand 5 states. [2018-11-18 12:21:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:01,997 INFO L93 Difference]: Finished difference Result 482 states and 665 transitions. [2018-11-18 12:21:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:21:01,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 12:21:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:01,998 INFO L225 Difference]: With dead ends: 482 [2018-11-18 12:21:01,998 INFO L226 Difference]: Without dead ends: 342 [2018-11-18 12:21:01,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:21:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-18 12:21:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-18 12:21:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 12:21:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 252 transitions. [2018-11-18 12:21:02,011 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 252 transitions. Word has length 44 [2018-11-18 12:21:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:02,011 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 252 transitions. [2018-11-18 12:21:02,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2018-11-18 12:21:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 12:21:02,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:02,013 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:02,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:02,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-11-18 12:21:02,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 12:21:02,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:02,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:21:02,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:02,079 INFO L87 Difference]: Start difference. First operand 185 states and 252 transitions. Second operand 5 states. [2018-11-18 12:21:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:02,254 INFO L93 Difference]: Finished difference Result 490 states and 673 transitions. [2018-11-18 12:21:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:21:02,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 12:21:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:02,255 INFO L225 Difference]: With dead ends: 490 [2018-11-18 12:21:02,255 INFO L226 Difference]: Without dead ends: 350 [2018-11-18 12:21:02,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:21:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-18 12:21:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-11-18 12:21:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 12:21:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2018-11-18 12:21:02,265 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 47 [2018-11-18 12:21:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:02,265 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2018-11-18 12:21:02,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2018-11-18 12:21:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 12:21:02,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:02,267 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:02,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:02,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1002470733, now seen corresponding path program 1 times [2018-11-18 12:21:02,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:02,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 12:21:02,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:02,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:21:02,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:02,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 12:21:02,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:21:02,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-18 12:21:02,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:02,444 INFO L87 Difference]: Start difference. First operand 200 states and 268 transitions. Second operand 7 states. [2018-11-18 12:21:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:02,782 INFO L93 Difference]: Finished difference Result 447 states and 638 transitions. [2018-11-18 12:21:02,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:02,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 12:21:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:02,783 INFO L225 Difference]: With dead ends: 447 [2018-11-18 12:21:02,783 INFO L226 Difference]: Without dead ends: 306 [2018-11-18 12:21:02,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:21:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-18 12:21:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 250. [2018-11-18 12:21:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 12:21:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 310 transitions. [2018-11-18 12:21:02,792 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 310 transitions. Word has length 50 [2018-11-18 12:21:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:02,793 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 310 transitions. [2018-11-18 12:21:02,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 310 transitions. [2018-11-18 12:21:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 12:21:02,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:02,794 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-11-18 12:21:02,795 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1224549471, now seen corresponding path program 1 times [2018-11-18 12:21:02,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 12:21:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:02,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:21:02,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:02,851 INFO L87 Difference]: Start difference. First operand 250 states and 310 transitions. Second operand 3 states. [2018-11-18 12:21:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:02,865 INFO L93 Difference]: Finished difference Result 299 states and 364 transitions. [2018-11-18 12:21:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:02,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-18 12:21:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:02,866 INFO L225 Difference]: With dead ends: 299 [2018-11-18 12:21:02,866 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 12:21:02,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 12:21:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-11-18 12:21:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 12:21:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 262 transitions. [2018-11-18 12:21:02,875 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 262 transitions. Word has length 58 [2018-11-18 12:21:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:02,876 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 262 transitions. [2018-11-18 12:21:02,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2018-11-18 12:21:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 12:21:02,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:02,877 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2018-11-18 12:21:02,877 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:02,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash -799436231, now seen corresponding path program 1 times [2018-11-18 12:21:02,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 12:21:02,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:02,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:21:02,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:02,937 INFO L87 Difference]: Start difference. First operand 212 states and 262 transitions. Second operand 5 states. [2018-11-18 12:21:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:03,127 INFO L93 Difference]: Finished difference Result 580 states and 722 transitions. [2018-11-18 12:21:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:21:03,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-18 12:21:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:03,128 INFO L225 Difference]: With dead ends: 580 [2018-11-18 12:21:03,128 INFO L226 Difference]: Without dead ends: 428 [2018-11-18 12:21:03,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-18 12:21:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2018-11-18 12:21:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 12:21:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2018-11-18 12:21:03,138 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 70 [2018-11-18 12:21:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:03,138 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2018-11-18 12:21:03,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2018-11-18 12:21:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 12:21:03,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:03,139 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2018-11-18 12:21:03,140 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:03,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1482230874, now seen corresponding path program 1 times [2018-11-18 12:21:03,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:03,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 12:21:03,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:03,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:03,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:03,189 INFO L87 Difference]: Start difference. First operand 268 states and 331 transitions. Second operand 3 states. [2018-11-18 12:21:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:03,205 INFO L93 Difference]: Finished difference Result 282 states and 345 transitions. [2018-11-18 12:21:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-18 12:21:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:03,208 INFO L225 Difference]: With dead ends: 282 [2018-11-18 12:21:03,208 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 12:21:03,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 12:21:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-11-18 12:21:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 12:21:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 330 transitions. [2018-11-18 12:21:03,216 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 330 transitions. Word has length 73 [2018-11-18 12:21:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:03,217 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 330 transitions. [2018-11-18 12:21:03,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 330 transitions. [2018-11-18 12:21:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 12:21:03,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:03,218 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2018-11-18 12:21:03,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:03,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 461162520, now seen corresponding path program 1 times [2018-11-18 12:21:03,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:03,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 12:21:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:03,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:03,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:21:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:21:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:21:03,294 INFO L87 Difference]: Start difference. First operand 268 states and 330 transitions. Second operand 4 states. [2018-11-18 12:21:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:03,364 INFO L93 Difference]: Finished difference Result 591 states and 726 transitions. [2018-11-18 12:21:03,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:21:03,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-18 12:21:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:03,366 INFO L225 Difference]: With dead ends: 591 [2018-11-18 12:21:03,366 INFO L226 Difference]: Without dead ends: 383 [2018-11-18 12:21:03,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:21:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-18 12:21:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 282. [2018-11-18 12:21:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-18 12:21:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 354 transitions. [2018-11-18 12:21:03,376 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 354 transitions. Word has length 73 [2018-11-18 12:21:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:03,376 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 354 transitions. [2018-11-18 12:21:03,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:21:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 354 transitions. [2018-11-18 12:21:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 12:21:03,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:03,377 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:03,378 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:03,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -779495320, now seen corresponding path program 1 times [2018-11-18 12:21:03,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:03,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:03,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:03,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 12:21:03,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:21:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:03,468 INFO L87 Difference]: Start difference. First operand 282 states and 354 transitions. Second operand 7 states. [2018-11-18 12:21:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:03,746 INFO L93 Difference]: Finished difference Result 823 states and 1054 transitions. [2018-11-18 12:21:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:03,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-18 12:21:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:03,749 INFO L225 Difference]: With dead ends: 823 [2018-11-18 12:21:03,749 INFO L226 Difference]: Without dead ends: 590 [2018-11-18 12:21:03,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:21:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-11-18 12:21:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 546. [2018-11-18 12:21:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-18 12:21:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 686 transitions. [2018-11-18 12:21:03,766 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 686 transitions. Word has length 79 [2018-11-18 12:21:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:03,766 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 686 transitions. [2018-11-18 12:21:03,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 686 transitions. [2018-11-18 12:21:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 12:21:03,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:03,768 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:03,768 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:03,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1303842300, now seen corresponding path program 1 times [2018-11-18 12:21:03,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:03,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 12:21:03,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:03,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:21:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:03,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 12:21:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:21:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-18 12:21:03,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:03,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:03,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:03,934 INFO L87 Difference]: Start difference. First operand 546 states and 686 transitions. Second operand 7 states. [2018-11-18 12:21:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:04,617 INFO L93 Difference]: Finished difference Result 2845 states and 3479 transitions. [2018-11-18 12:21:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 12:21:04,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-18 12:21:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:04,621 INFO L225 Difference]: With dead ends: 2845 [2018-11-18 12:21:04,621 INFO L226 Difference]: Without dead ends: 2146 [2018-11-18 12:21:04,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:21:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-11-18 12:21:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 923. [2018-11-18 12:21:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-18 12:21:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1238 transitions. [2018-11-18 12:21:04,647 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1238 transitions. Word has length 79 [2018-11-18 12:21:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:04,648 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1238 transitions. [2018-11-18 12:21:04,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1238 transitions. [2018-11-18 12:21:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 12:21:04,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:04,649 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:04,650 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:04,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1251195231, now seen corresponding path program 1 times [2018-11-18 12:21:04,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:04,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:04,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:04,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69359e5-5fa7-4870-9b01-252c6899c355/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:21:04,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:04,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 12:21:04,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:21:04,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2018-11-18 12:21:04,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:04,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:04,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:04,797 INFO L87 Difference]: Start difference. First operand 923 states and 1238 transitions. Second operand 7 states. [2018-11-18 12:21:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:05,037 INFO L93 Difference]: Finished difference Result 2234 states and 2993 transitions. [2018-11-18 12:21:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:05,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-18 12:21:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:05,041 INFO L225 Difference]: With dead ends: 2234 [2018-11-18 12:21:05,041 INFO L226 Difference]: Without dead ends: 1279 [2018-11-18 12:21:05,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:21:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-11-18 12:21:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1138. [2018-11-18 12:21:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-11-18 12:21:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1525 transitions. [2018-11-18 12:21:05,078 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1525 transitions. Word has length 85 [2018-11-18 12:21:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:05,078 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1525 transitions. [2018-11-18 12:21:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1525 transitions. [2018-11-18 12:21:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 12:21:05,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:05,080 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:05,080 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:05,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1693291530, now seen corresponding path program 1 times [2018-11-18 12:21:05,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:05,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:05,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 12:21:05,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:21:05,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:05,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:05,164 INFO L87 Difference]: Start difference. First operand 1138 states and 1525 transitions. Second operand 7 states. [2018-11-18 12:21:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:05,571 INFO L93 Difference]: Finished difference Result 3577 states and 4763 transitions. [2018-11-18 12:21:05,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:21:05,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-18 12:21:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:05,577 INFO L225 Difference]: With dead ends: 3577 [2018-11-18 12:21:05,577 INFO L226 Difference]: Without dead ends: 2288 [2018-11-18 12:21:05,580 INFO L604 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-11-18 12:21:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-11-18 12:21:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 1978. [2018-11-18 12:21:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2018-11-18 12:21:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2628 transitions. [2018-11-18 12:21:05,636 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2628 transitions. Word has length 91 [2018-11-18 12:21:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:05,636 INFO L480 AbstractCegarLoop]: Abstraction has 1978 states and 2628 transitions. [2018-11-18 12:21:05,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2628 transitions. [2018-11-18 12:21:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 12:21:05,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:05,638 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:05,638 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:05,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1972365061, now seen corresponding path program 1 times [2018-11-18 12:21:05,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:05,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 12:21:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:21:05,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:05,718 INFO L87 Difference]: Start difference. First operand 1978 states and 2628 transitions. Second operand 7 states. [2018-11-18 12:21:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:06,163 INFO L93 Difference]: Finished difference Result 6399 states and 8404 transitions. [2018-11-18 12:21:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:06,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-18 12:21:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:06,170 INFO L225 Difference]: With dead ends: 6399 [2018-11-18 12:21:06,170 INFO L226 Difference]: Without dead ends: 4083 [2018-11-18 12:21:06,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:21:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2018-11-18 12:21:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 3420. [2018-11-18 12:21:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2018-11-18 12:21:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4474 transitions. [2018-11-18 12:21:06,228 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4474 transitions. Word has length 91 [2018-11-18 12:21:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:06,228 INFO L480 AbstractCegarLoop]: Abstraction has 3420 states and 4474 transitions. [2018-11-18 12:21:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4474 transitions. [2018-11-18 12:21:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 12:21:06,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:06,231 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:06,231 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:06,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1322896811, now seen corresponding path program 1 times [2018-11-18 12:21:06,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:06,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:06,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 12:21:06,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:06,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:21:06,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:21:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:21:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:21:06,332 INFO L87 Difference]: Start difference. First operand 3420 states and 4474 transitions. Second operand 8 states. [2018-11-18 12:21:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:06,895 INFO L93 Difference]: Finished difference Result 7688 states and 10019 transitions. [2018-11-18 12:21:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:21:06,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-18 12:21:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:06,903 INFO L225 Difference]: With dead ends: 7688 [2018-11-18 12:21:06,903 INFO L226 Difference]: Without dead ends: 4031 [2018-11-18 12:21:06,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-18 12:21:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2018-11-18 12:21:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3660. [2018-11-18 12:21:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3660 states. [2018-11-18 12:21:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4764 transitions. [2018-11-18 12:21:07,000 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4764 transitions. Word has length 94 [2018-11-18 12:21:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:07,000 INFO L480 AbstractCegarLoop]: Abstraction has 3660 states and 4764 transitions. [2018-11-18 12:21:07,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:21:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4764 transitions. [2018-11-18 12:21:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 12:21:07,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:07,003 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:07,003 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:07,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 326528789, now seen corresponding path program 1 times [2018-11-18 12:21:07,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:07,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:07,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:07,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 12:21:07,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:21:07,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:21:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:21:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:21:07,137 INFO L87 Difference]: Start difference. First operand 3660 states and 4764 transitions. Second operand 8 states. [2018-11-18 12:21:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:07,601 INFO L93 Difference]: Finished difference Result 8454 states and 10962 transitions. [2018-11-18 12:21:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:21:07,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-18 12:21:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:07,612 INFO L225 Difference]: With dead ends: 8454 [2018-11-18 12:21:07,612 INFO L226 Difference]: Without dead ends: 4927 [2018-11-18 12:21:07,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:21:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2018-11-18 12:21:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4567. [2018-11-18 12:21:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2018-11-18 12:21:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 5843 transitions. [2018-11-18 12:21:07,720 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 5843 transitions. Word has length 94 [2018-11-18 12:21:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:07,720 INFO L480 AbstractCegarLoop]: Abstraction has 4567 states and 5843 transitions. [2018-11-18 12:21:07,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:21:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 5843 transitions. [2018-11-18 12:21:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 12:21:07,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:07,723 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:07,724 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:07,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2076295601, now seen corresponding path program 1 times [2018-11-18 12:21:07,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:07,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:07,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 12:21:07,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:07,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:21:07,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:21:07,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:21:07,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:21:07,847 INFO L87 Difference]: Start difference. First operand 4567 states and 5843 transitions. Second operand 9 states. [2018-11-18 12:21:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:08,466 INFO L93 Difference]: Finished difference Result 5635 states and 7154 transitions. [2018-11-18 12:21:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:21:08,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 12:21:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:08,474 INFO L225 Difference]: With dead ends: 5635 [2018-11-18 12:21:08,474 INFO L226 Difference]: Without dead ends: 3289 [2018-11-18 12:21:08,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:21:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2018-11-18 12:21:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3122. [2018-11-18 12:21:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2018-11-18 12:21:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 3939 transitions. [2018-11-18 12:21:08,553 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 3939 transitions. Word has length 96 [2018-11-18 12:21:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:08,553 INFO L480 AbstractCegarLoop]: Abstraction has 3122 states and 3939 transitions. [2018-11-18 12:21:08,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:21:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 3939 transitions. [2018-11-18 12:21:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 12:21:08,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:08,555 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:08,555 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:08,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1060798959, now seen corresponding path program 1 times [2018-11-18 12:21:08,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:08,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:08,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:08,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:08,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 12:21:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:08,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:21:08,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:21:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:21:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:21:08,673 INFO L87 Difference]: Start difference. First operand 3122 states and 3939 transitions. Second operand 9 states. [2018-11-18 12:21:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:09,097 INFO L93 Difference]: Finished difference Result 3518 states and 4397 transitions. [2018-11-18 12:21:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:21:09,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 12:21:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:09,102 INFO L225 Difference]: With dead ends: 3518 [2018-11-18 12:21:09,102 INFO L226 Difference]: Without dead ends: 1865 [2018-11-18 12:21:09,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:21:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-11-18 12:21:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1769. [2018-11-18 12:21:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2018-11-18 12:21:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2183 transitions. [2018-11-18 12:21:09,150 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2183 transitions. Word has length 96 [2018-11-18 12:21:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:09,150 INFO L480 AbstractCegarLoop]: Abstraction has 1769 states and 2183 transitions. [2018-11-18 12:21:09,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:21:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2183 transitions. [2018-11-18 12:21:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 12:21:09,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,152 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,152 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1775167391, now seen corresponding path program 1 times [2018-11-18 12:21:09,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:09,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:09,205 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:21:09,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:21:09 BoogieIcfgContainer [2018-11-18 12:21:09,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:21:09,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:21:09,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:21:09,251 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:21:09,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:00" (3/4) ... [2018-11-18 12:21:09,255 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:21:09,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:21:09,256 INFO L168 Benchmark]: Toolchain (without parser) took 9211.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 953.8 MB in the beginning and 854.6 MB in the end (delta: 99.2 MB). Peak memory consumption was 458.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:09,257 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:09,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:09,257 INFO L168 Benchmark]: Boogie Preprocessor took 64.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:09,258 INFO L168 Benchmark]: RCFGBuilder took 349.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:09,258 INFO L168 Benchmark]: TraceAbstraction took 8589.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 269.1 MB). Peak memory consumption was 464.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:09,259 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.4 GB. Free memory is still 854.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:09,261 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 349.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8589.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 269.1 MB). Peak memory consumption was 464.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.4 GB. Free memory is still 854.6 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, 128 locations, 38 error locations. UNSAFE Result, 8.5s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2306 SDtfs, 5020 SDslu, 5612 SDs, 0 SdLazy, 5952 SolverSat, 572 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 10 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4567occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 4115 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1629 NumberOfCodeBlocks, 1629 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1504 ConstructedInterpolants, 28 QuantifiedInterpolants, 369201 SizeOfPredicates, 6 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1376/1398 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...