./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-1dbac8b [2018-10-27 05:47:41,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:47:41,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:47:41,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:47:41,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:47:41,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:47:41,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:47:41,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:47:41,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:47:41,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:47:41,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:47:41,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:47:41,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:47:41,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:47:41,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:47:41,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:47:41,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:47:41,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:47:41,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:47:41,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:47:41,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:47:41,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:47:41,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:47:41,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:47:41,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:47:41,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:47:41,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:47:41,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:47:41,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:47:41,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:47:41,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:47:41,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:47:41,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:47:41,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:47:41,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:47:41,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:47:41,428 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-10-27 05:47:41,444 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:47:41,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:47:41,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:47:41,448 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 05:47:41,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 05:47:41,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 05:47:41,449 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 05:47:41,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:47:41,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 05:47:41,449 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:47:41,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:47:41,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 05:47:41,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:47:41,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:47:41,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:47:41,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:47:41,451 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:47:41,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 05:47:41,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:47:41,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:47:41,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:47:41,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:47:41,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:47:41,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:47:41,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:47:41,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:47:41,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:47:41,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:47:41,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 05:47:41,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:47:41,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:47:41,453 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_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-10-27 05:47:41,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:47:41,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:47:41,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:47:41,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:47:41,509 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:47:41,510 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-10-27 05:47:41,573 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/data/850963109/8998bd73797445fa83e3154ff7b1edf3/FLAG61eb5eefb [2018-10-27 05:47:41,942 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:47:41,943 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-10-27 05:47:41,950 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/data/850963109/8998bd73797445fa83e3154ff7b1edf3/FLAG61eb5eefb [2018-10-27 05:47:41,962 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/bin-2019/uautomizer/data/850963109/8998bd73797445fa83e3154ff7b1edf3 [2018-10-27 05:47:41,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:47:41,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 05:47:41,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:41,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:47:41,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:47:41,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:41" (1/1) ... [2018-10-27 05:47:41,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378ff548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:41, skipping insertion in model container [2018-10-27 05:47:41,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:41" (1/1) ... [2018-10-27 05:47:41,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:47:42,015 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:47:42,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:42,170 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:47:42,206 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:42,225 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:47:42,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42 WrapperNode [2018-10-27 05:47:42,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:42,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:47:42,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:47:42,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:47:42,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... [2018-10-27 05:47:42,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:47:42,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:47:42,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:47:42,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:47:42,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-10-27 05:47:42,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:47:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:47:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 05:47:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-10-27 05:47:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:47:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 05:47:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-10-27 05:47:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:47:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:47:43,255 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:47:43,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:43 BoogieIcfgContainer [2018-10-27 05:47:43,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:47:43,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:47:43,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:47:43,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:47:43,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:47:41" (1/3) ... [2018-10-27 05:47:43,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297be36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:47:43, skipping insertion in model container [2018-10-27 05:47:43,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:42" (2/3) ... [2018-10-27 05:47:43,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297be36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:47:43, skipping insertion in model container [2018-10-27 05:47:43,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:43" (3/3) ... [2018-10-27 05:47:43,265 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-10-27 05:47:43,274 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:47:43,281 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-10-27 05:47:43,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-10-27 05:47:43,321 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 05:47:43,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:47:43,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:47:43,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:47:43,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:47:43,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:47:43,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:47:43,323 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:47:43,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:47:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-10-27 05:47:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:47:43,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:43,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:43,352 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:43,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-10-27 05:47:43,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:43,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:43,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 05:47:43,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 05:47:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 05:47:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 05:47:43,483 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-10-27 05:47:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:43,506 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-10-27 05:47:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 05:47:43,507 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-27 05:47:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:43,516 INFO L225 Difference]: With dead ends: 157 [2018-10-27 05:47:43,516 INFO L226 Difference]: Without dead ends: 76 [2018-10-27 05:47:43,519 INFO L605 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-10-27 05:47:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-27 05:47:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-27 05:47:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 05:47:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-10-27 05:47:43,556 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-10-27 05:47:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:43,556 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-10-27 05:47:43,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 05:47:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-10-27 05:47:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:47:43,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:43,558 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-10-27 05:47:43,559 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:43,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-10-27 05:47:43,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:43,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:43,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:43,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:47:43,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:43,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:43,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:43,772 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-10-27 05:47:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:44,312 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-10-27 05:47:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:44,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 05:47:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:44,314 INFO L225 Difference]: With dead ends: 156 [2018-10-27 05:47:44,314 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 05:47:44,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 05:47:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-27 05:47:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 05:47:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-10-27 05:47:44,326 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-10-27 05:47:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:44,326 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-10-27 05:47:44,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-10-27 05:47:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 05:47:44,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:44,328 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-10-27 05:47:44,330 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:44,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-10-27 05:47:44,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:44,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:44,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:44,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:44,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:44,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:47:44,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:47:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:47:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:44,446 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-10-27 05:47:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:45,077 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-10-27 05:47:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:45,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-27 05:47:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:45,080 INFO L225 Difference]: With dead ends: 203 [2018-10-27 05:47:45,080 INFO L226 Difference]: Without dead ends: 154 [2018-10-27 05:47:45,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-27 05:47:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-10-27 05:47:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 05:47:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-10-27 05:47:45,092 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-10-27 05:47:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:45,093 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-10-27 05:47:45,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:47:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-10-27 05:47:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 05:47:45,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:45,094 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-10-27 05:47:45,099 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:45,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-10-27 05:47:45,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:47:45,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:47:45,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:47:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:47:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:45,226 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-10-27 05:47:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:45,563 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-10-27 05:47:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:47:45,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-27 05:47:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:45,565 INFO L225 Difference]: With dead ends: 303 [2018-10-27 05:47:45,565 INFO L226 Difference]: Without dead ends: 207 [2018-10-27 05:47:45,566 INFO L605 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-10-27 05:47:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-27 05:47:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-10-27 05:47:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-27 05:47:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-10-27 05:47:45,582 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-10-27 05:47:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:45,582 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-10-27 05:47:45,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:47:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-10-27 05:47:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 05:47:45,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:45,585 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-10-27 05:47:45,586 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:45,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-10-27 05:47:45,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:45,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 05:47:45,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:47:45,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:47:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:47:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:45,683 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-10-27 05:47:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:46,119 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-10-27 05:47:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:46,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-27 05:47:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:46,121 INFO L225 Difference]: With dead ends: 482 [2018-10-27 05:47:46,121 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 05:47:46,122 INFO L605 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-10-27 05:47:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 05:47:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-10-27 05:47:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 05:47:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-10-27 05:47:46,136 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-10-27 05:47:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:46,137 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-10-27 05:47:46,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:47:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-10-27 05:47:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 05:47:46,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:46,138 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-10-27 05:47:46,141 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-10-27 05:47:46,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 05:47:46,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:46,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:47:46,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:47:46,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:47:46,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:46,332 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-10-27 05:47:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:46,628 INFO L93 Difference]: Finished difference Result 490 states and 637 transitions. [2018-10-27 05:47:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:46,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-10-27 05:47:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:46,630 INFO L225 Difference]: With dead ends: 490 [2018-10-27 05:47:46,630 INFO L226 Difference]: Without dead ends: 350 [2018-10-27 05:47:46,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:47:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-27 05:47:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-10-27 05:47:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-27 05:47:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2018-10-27 05:47:46,645 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 47 [2018-10-27 05:47:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:46,645 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2018-10-27 05:47:46,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:47:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2018-10-27 05:47:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 05:47:46,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:46,649 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-10-27 05:47:46,650 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1002470733, now seen corresponding path program 1 times [2018-10-27 05:47:46,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:47:46,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:46,763 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-10-27 05:47:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:46,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 05:47:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:46,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-27 05:47:46,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:47:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:47:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:47:46,935 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 7 states. [2018-10-27 05:47:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:48,176 INFO L93 Difference]: Finished difference Result 431 states and 584 transitions. [2018-10-27 05:47:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:47:48,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-27 05:47:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:48,178 INFO L225 Difference]: With dead ends: 431 [2018-10-27 05:47:48,178 INFO L226 Difference]: Without dead ends: 294 [2018-10-27 05:47:48,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:47:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-27 05:47:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 260. [2018-10-27 05:47:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 05:47:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 326 transitions. [2018-10-27 05:47:48,192 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 326 transitions. Word has length 50 [2018-10-27 05:47:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:48,193 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 326 transitions. [2018-10-27 05:47:48,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:47:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 326 transitions. [2018-10-27 05:47:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 05:47:48,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:48,194 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-10-27 05:47:48,195 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:48,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1224549471, now seen corresponding path program 1 times [2018-10-27 05:47:48,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:48,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:48,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 05:47:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:48,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:47:48,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:48,401 INFO L87 Difference]: Start difference. First operand 260 states and 326 transitions. Second operand 3 states. [2018-10-27 05:47:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:48,448 INFO L93 Difference]: Finished difference Result 309 states and 380 transitions. [2018-10-27 05:47:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:48,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-27 05:47:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:48,450 INFO L225 Difference]: With dead ends: 309 [2018-10-27 05:47:48,450 INFO L226 Difference]: Without dead ends: 222 [2018-10-27 05:47:48,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-27 05:47:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-27 05:47:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 05:47:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 278 transitions. [2018-10-27 05:47:48,460 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 278 transitions. Word has length 58 [2018-10-27 05:47:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:48,460 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 278 transitions. [2018-10-27 05:47:48,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 278 transitions. [2018-10-27 05:47:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-27 05:47:48,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:48,465 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-10-27 05:47:48,465 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:48,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash -799436231, now seen corresponding path program 1 times [2018-10-27 05:47:48,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:48,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:48,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:48,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:48,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 05:47:48,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:48,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:47:48,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:47:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:47:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:48,584 INFO L87 Difference]: Start difference. First operand 222 states and 278 transitions. Second operand 5 states. [2018-10-27 05:47:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:49,266 INFO L93 Difference]: Finished difference Result 613 states and 774 transitions. [2018-10-27 05:47:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:47:49,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-10-27 05:47:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:49,270 INFO L225 Difference]: With dead ends: 613 [2018-10-27 05:47:49,270 INFO L226 Difference]: Without dead ends: 451 [2018-10-27 05:47:49,270 INFO L605 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-10-27 05:47:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-27 05:47:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 282. [2018-10-27 05:47:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-27 05:47:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 353 transitions. [2018-10-27 05:47:49,285 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 353 transitions. Word has length 70 [2018-10-27 05:47:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:49,285 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 353 transitions. [2018-10-27 05:47:49,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:47:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 353 transitions. [2018-10-27 05:47:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 05:47:49,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:49,287 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-10-27 05:47:49,287 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:49,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1482230874, now seen corresponding path program 1 times [2018-10-27 05:47:49,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:49,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-27 05:47:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:47:49,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:49,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:49,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:49,363 INFO L87 Difference]: Start difference. First operand 282 states and 353 transitions. Second operand 3 states. [2018-10-27 05:47:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:49,419 INFO L93 Difference]: Finished difference Result 296 states and 367 transitions. [2018-10-27 05:47:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:49,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-10-27 05:47:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:49,422 INFO L225 Difference]: With dead ends: 296 [2018-10-27 05:47:49,422 INFO L226 Difference]: Without dead ends: 282 [2018-10-27 05:47:49,422 INFO L605 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-10-27 05:47:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-27 05:47:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-10-27 05:47:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-27 05:47:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 352 transitions. [2018-10-27 05:47:49,432 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 352 transitions. Word has length 73 [2018-10-27 05:47:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:49,432 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 352 transitions. [2018-10-27 05:47:49,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 352 transitions. [2018-10-27 05:47:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 05:47:49,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:49,433 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-10-27 05:47:49,434 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:49,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 461162520, now seen corresponding path program 1 times [2018-10-27 05:47:49,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:49,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 05:47:49,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:47:49,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:47:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:47:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:49,696 INFO L87 Difference]: Start difference. First operand 282 states and 352 transitions. Second operand 4 states. [2018-10-27 05:47:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:50,368 INFO L93 Difference]: Finished difference Result 619 states and 770 transitions. [2018-10-27 05:47:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:50,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-10-27 05:47:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:50,371 INFO L225 Difference]: With dead ends: 619 [2018-10-27 05:47:50,371 INFO L226 Difference]: Without dead ends: 397 [2018-10-27 05:47:50,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-27 05:47:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 296. [2018-10-27 05:47:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-27 05:47:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 376 transitions. [2018-10-27 05:47:50,379 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 376 transitions. Word has length 73 [2018-10-27 05:47:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:50,379 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 376 transitions. [2018-10-27 05:47:50,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:47:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2018-10-27 05:47:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 05:47:50,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:50,380 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-10-27 05:47:50,381 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:50,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash -779495320, now seen corresponding path program 1 times [2018-10-27 05:47:50,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:50,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:50,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:47:50,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:50,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:47:50,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:47:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:47:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:47:50,571 INFO L87 Difference]: Start difference. First operand 296 states and 376 transitions. Second operand 6 states. [2018-10-27 05:47:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:51,326 INFO L93 Difference]: Finished difference Result 871 states and 1130 transitions. [2018-10-27 05:47:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:47:51,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-10-27 05:47:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:51,328 INFO L225 Difference]: With dead ends: 871 [2018-10-27 05:47:51,328 INFO L226 Difference]: Without dead ends: 624 [2018-10-27 05:47:51,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:47:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-27 05:47:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 580. [2018-10-27 05:47:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-27 05:47:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 738 transitions. [2018-10-27 05:47:51,344 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 738 transitions. Word has length 79 [2018-10-27 05:47:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:51,344 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 738 transitions. [2018-10-27 05:47:51,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:47:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 738 transitions. [2018-10-27 05:47:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 05:47:51,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:51,345 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-10-27 05:47:51,346 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:51,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1303842300, now seen corresponding path program 1 times [2018-10-27 05:47:51,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:51,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 05:47:51,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:51,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-10-27 05:47:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:51,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 05:47:51,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:51,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-10-27 05:47:51,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:47:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:47:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:47:51,597 INFO L87 Difference]: Start difference. First operand 580 states and 738 transitions. Second operand 7 states. [2018-10-27 05:47:52,478 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 05:47:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:53,542 INFO L93 Difference]: Finished difference Result 2983 states and 3691 transitions. [2018-10-27 05:47:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 05:47:53,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-27 05:47:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:53,548 INFO L225 Difference]: With dead ends: 2983 [2018-10-27 05:47:53,548 INFO L226 Difference]: Without dead ends: 2250 [2018-10-27 05:47:53,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:47:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2018-10-27 05:47:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 952. [2018-10-27 05:47:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-10-27 05:47:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1290 transitions. [2018-10-27 05:47:53,588 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1290 transitions. Word has length 79 [2018-10-27 05:47:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:53,588 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 1290 transitions. [2018-10-27 05:47:53,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:47:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1290 transitions. [2018-10-27 05:47:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 05:47:53,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:53,590 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-10-27 05:47:53,590 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:53,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1251195231, now seen corresponding path program 1 times [2018-10-27 05:47:53,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:53,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 05:47:53,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:53,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd2a2ad-9580-4418-81c1-0d71bc50cdec/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-10-27 05:47:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:53,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 05:47:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:54,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-10-27 05:47:54,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:47:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:47:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=24, Unknown=2, NotChecked=0, Total=42 [2018-10-27 05:47:54,354 INFO L87 Difference]: Start difference. First operand 952 states and 1290 transitions. Second operand 7 states. [2018-10-27 05:47:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:59,985 INFO L93 Difference]: Finished difference Result 2324 states and 3139 transitions. [2018-10-27 05:47:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:47:59,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-10-27 05:47:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:59,988 INFO L225 Difference]: With dead ends: 2324 [2018-10-27 05:47:59,988 INFO L226 Difference]: Without dead ends: 1340 [2018-10-27 05:47:59,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=61, Unknown=5, NotChecked=0, Total=110 [2018-10-27 05:47:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2018-10-27 05:48:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1185. [2018-10-27 05:48:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-10-27 05:48:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1605 transitions. [2018-10-27 05:48:00,042 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1605 transitions. Word has length 85 [2018-10-27 05:48:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:00,042 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1605 transitions. [2018-10-27 05:48:00,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1605 transitions. [2018-10-27 05:48:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 05:48:00,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:00,045 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-10-27 05:48:00,046 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:00,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1693291530, now seen corresponding path program 1 times [2018-10-27 05:48:00,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:00,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:00,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:00,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-27 05:48:00,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:00,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 05:48:00,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:00,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:00,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:48:00,364 INFO L87 Difference]: Start difference. First operand 1185 states and 1605 transitions. Second operand 7 states. [2018-10-27 05:48:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:02,116 INFO L93 Difference]: Finished difference Result 3730 states and 4998 transitions. [2018-10-27 05:48:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:48:02,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-27 05:48:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:02,123 INFO L225 Difference]: With dead ends: 3730 [2018-10-27 05:48:02,123 INFO L226 Difference]: Without dead ends: 2359 [2018-10-27 05:48:02,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:48:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2018-10-27 05:48:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2257. [2018-10-27 05:48:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-10-27 05:48:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3021 transitions. [2018-10-27 05:48:02,199 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3021 transitions. Word has length 91 [2018-10-27 05:48:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:02,200 INFO L481 AbstractCegarLoop]: Abstraction has 2257 states and 3021 transitions. [2018-10-27 05:48:02,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3021 transitions. [2018-10-27 05:48:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 05:48:02,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:02,202 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-10-27 05:48:02,202 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:02,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1972365061, now seen corresponding path program 1 times [2018-10-27 05:48:02,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:02,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 05:48:04,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:04,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 05:48:04,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:48:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:48:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2018-10-27 05:48:04,681 INFO L87 Difference]: Start difference. First operand 2257 states and 3021 transitions. Second operand 7 states. [2018-10-27 05:48:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:07,446 INFO L93 Difference]: Finished difference Result 7107 states and 9391 transitions. [2018-10-27 05:48:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:48:07,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-27 05:48:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:07,462 INFO L225 Difference]: With dead ends: 7107 [2018-10-27 05:48:07,463 INFO L226 Difference]: Without dead ends: 4450 [2018-10-27 05:48:07,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=36, Invalid=73, Unknown=1, NotChecked=0, Total=110 [2018-10-27 05:48:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2018-10-27 05:48:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4295. [2018-10-27 05:48:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2018-10-27 05:48:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5663 transitions. [2018-10-27 05:48:07,640 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5663 transitions. Word has length 91 [2018-10-27 05:48:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:07,641 INFO L481 AbstractCegarLoop]: Abstraction has 4295 states and 5663 transitions. [2018-10-27 05:48:07,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:48:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5663 transitions. [2018-10-27 05:48:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 05:48:07,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:07,654 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-10-27 05:48:07,654 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:07,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1322896811, now seen corresponding path program 1 times [2018-10-27 05:48:07,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:07,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:07,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:08,471 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-27 05:48:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-27 05:48:08,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:08,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 05:48:08,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:08,549 INFO L87 Difference]: Start difference. First operand 4295 states and 5663 transitions. Second operand 8 states. [2018-10-27 05:48:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:12,371 INFO L93 Difference]: Finished difference Result 8039 states and 10539 transitions. [2018-10-27 05:48:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 05:48:12,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-10-27 05:48:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:12,382 INFO L225 Difference]: With dead ends: 8039 [2018-10-27 05:48:12,382 INFO L226 Difference]: Without dead ends: 4854 [2018-10-27 05:48:12,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:48:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4854 states. [2018-10-27 05:48:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4854 to 4690. [2018-10-27 05:48:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2018-10-27 05:48:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 6142 transitions. [2018-10-27 05:48:12,522 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 6142 transitions. Word has length 94 [2018-10-27 05:48:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:12,523 INFO L481 AbstractCegarLoop]: Abstraction has 4690 states and 6142 transitions. [2018-10-27 05:48:12,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 6142 transitions. [2018-10-27 05:48:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 05:48:12,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:12,532 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-10-27 05:48:12,533 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 326528789, now seen corresponding path program 1 times [2018-10-27 05:48:12,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:12,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 05:48:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 05:48:12,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:48:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:48:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:48:12,728 INFO L87 Difference]: Start difference. First operand 4690 states and 6142 transitions. Second operand 8 states. [2018-10-27 05:48:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:19,414 INFO L93 Difference]: Finished difference Result 8234 states and 10739 transitions. [2018-10-27 05:48:19,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:48:19,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-10-27 05:48:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:19,428 INFO L225 Difference]: With dead ends: 8234 [2018-10-27 05:48:19,429 INFO L226 Difference]: Without dead ends: 5546 [2018-10-27 05:48:19,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:48:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-10-27 05:48:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5007. [2018-10-27 05:48:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5007 states. [2018-10-27 05:48:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 6542 transitions. [2018-10-27 05:48:19,547 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 6542 transitions. Word has length 94 [2018-10-27 05:48:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:19,547 INFO L481 AbstractCegarLoop]: Abstraction has 5007 states and 6542 transitions. [2018-10-27 05:48:19,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:48:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 6542 transitions. [2018-10-27 05:48:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 05:48:19,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:19,553 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-10-27 05:48:19,554 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:19,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2076295601, now seen corresponding path program 1 times [2018-10-27 05:48:19,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-27 05:48:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 05:48:19,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:19,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:19,753 INFO L87 Difference]: Start difference. First operand 5007 states and 6542 transitions. Second operand 9 states. [2018-10-27 05:48:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:26,446 INFO L93 Difference]: Finished difference Result 7902 states and 10250 transitions. [2018-10-27 05:48:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:48:26,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-10-27 05:48:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:26,458 INFO L225 Difference]: With dead ends: 7902 [2018-10-27 05:48:26,458 INFO L226 Difference]: Without dead ends: 3827 [2018-10-27 05:48:26,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:48:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2018-10-27 05:48:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3174. [2018-10-27 05:48:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-10-27 05:48:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4072 transitions. [2018-10-27 05:48:26,525 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4072 transitions. Word has length 96 [2018-10-27 05:48:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:26,525 INFO L481 AbstractCegarLoop]: Abstraction has 3174 states and 4072 transitions. [2018-10-27 05:48:26,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4072 transitions. [2018-10-27 05:48:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 05:48:26,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:26,528 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-10-27 05:48:26,528 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:26,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1060798959, now seen corresponding path program 1 times [2018-10-27 05:48:26,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:26,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:26,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:48:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 05:48:26,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:48:26,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 05:48:26,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:48:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:48:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:48:26,838 INFO L87 Difference]: Start difference. First operand 3174 states and 4072 transitions. Second operand 9 states. [2018-10-27 05:48:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:48:29,705 INFO L93 Difference]: Finished difference Result 4582 states and 5805 transitions. [2018-10-27 05:48:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:48:29,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-10-27 05:48:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:48:29,710 INFO L225 Difference]: With dead ends: 4582 [2018-10-27 05:48:29,710 INFO L226 Difference]: Without dead ends: 2251 [2018-10-27 05:48:29,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:48:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2018-10-27 05:48:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2033. [2018-10-27 05:48:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2018-10-27 05:48:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2567 transitions. [2018-10-27 05:48:29,769 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2567 transitions. Word has length 96 [2018-10-27 05:48:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:48:29,769 INFO L481 AbstractCegarLoop]: Abstraction has 2033 states and 2567 transitions. [2018-10-27 05:48:29,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:48:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2567 transitions. [2018-10-27 05:48:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 05:48:29,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:48:29,774 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-10-27 05:48:29,775 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:48:29,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:48:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1775167391, now seen corresponding path program 1 times [2018-10-27 05:48:29,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:48:29,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:48:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:48:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:48:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:48:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:48:29,845 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 05:48:29,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:48:29 BoogieIcfgContainer [2018-10-27 05:48:29,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:48:29,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:48:29,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:48:29,944 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:48:29,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:43" (3/4) ... [2018-10-27 05:48:29,950 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 05:48:29,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:48:29,951 INFO L168 Benchmark]: Toolchain (without parser) took 47984.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 960.7 MB in the beginning and 961.4 MB in the end (delta: -626.0 kB). Peak memory consumption was 228.5 MB. Max. memory is 11.5 GB. [2018-10-27 05:48:29,952 INFO L168 Benchmark]: CDTParser took 0.17 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-10-27 05:48:29,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:48:29,953 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:48:29,953 INFO L168 Benchmark]: RCFGBuilder took 981.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:48:29,954 INFO L168 Benchmark]: TraceAbstraction took 46686.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 157.4 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2018-10-27 05:48:29,954 INFO L168 Benchmark]: Witness Printer took 6.00 ms. Allocated memory is still 1.3 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:48:29,961 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.17 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 257.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.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 40.67 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 981.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46686.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 157.4 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.00 ms. Allocated memory is still 1.3 GB. Free memory is still 961.4 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, 46.6s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 38.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2354 SDtfs, 4817 SDslu, 5707 SDs, 0 SdLazy, 6379 SolverSat, 538 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 33.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 262 SyntacticMatches, 9 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5007occurred 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.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 4003 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1629 NumberOfCodeBlocks, 1629 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1504 ConstructedInterpolants, 31 QuantifiedInterpolants, 340203 SizeOfPredicates, 6 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1378/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...