./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_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_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/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 758587bcbf021ce28de3aa106c09f74804dbda1d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/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-11-10 06:11:04,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:11:04,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:11:04,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:11:04,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:11:04,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:11:04,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:11:04,278 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:11:04,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:11:04,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:11:04,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:11:04,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:11:04,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:11:04,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:11:04,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:11:04,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:11:04,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:11:04,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:11:04,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:11:04,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:11:04,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:11:04,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:11:04,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:11:04,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:11:04,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:11:04,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:11:04,293 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:11:04,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:11:04,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:11:04,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:11:04,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:11:04,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:11:04,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:11:04,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:11:04,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:11:04,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:11:04,298 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-10 06:11:04,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:11:04,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:11:04,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:11:04,309 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:11:04,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:11:04,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:11:04,310 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:11:04,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:11:04,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:11:04,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:11:04,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:11:04,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:11:04,313 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_2a23f7d6-b43b-444c-b871-f7cafd2943cc/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 -> 758587bcbf021ce28de3aa106c09f74804dbda1d [2018-11-10 06:11:04,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:11:04,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:11:04,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:11:04,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:11:04,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:11:04,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-10 06:11:04,380 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/data/7b3771ddc/25807021474d41a2b30420bf28677d19/FLAG59b99dab5 [2018-11-10 06:11:04,780 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:11:04,781 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-10 06:11:04,785 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/data/7b3771ddc/25807021474d41a2b30420bf28677d19/FLAG59b99dab5 [2018-11-10 06:11:04,796 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/data/7b3771ddc/25807021474d41a2b30420bf28677d19 [2018-11-10 06:11:04,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:11:04,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:11:04,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:11:04,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:11:04,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:11:04,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:04,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04, skipping insertion in model container [2018-11-10 06:11:04,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:04,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:11:04,829 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:11:04,944 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:11:04,947 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:11:04,972 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:11:04,984 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:11:04,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04 WrapperNode [2018-11-10 06:11:04,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:11:04,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:11:04,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:11:04,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:11:04,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:04,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:04,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:05,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:05,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:05,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:05,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... [2018-11-10 06:11:05,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:11:05,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:11:05,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:11:05,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:11:05,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 06:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 06:11:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 06:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:11:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:11:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:11:05,418 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:11:05,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:11:05 BoogieIcfgContainer [2018-11-10 06:11:05,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:11:05,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:11:05,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:11:05,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:11:05,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:11:04" (1/3) ... [2018-11-10 06:11:05,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92ddffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:11:05, skipping insertion in model container [2018-11-10 06:11:05,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:11:04" (2/3) ... [2018-11-10 06:11:05,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92ddffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:11:05, skipping insertion in model container [2018-11-10 06:11:05,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:11:05" (3/3) ... [2018-11-10 06:11:05,424 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2_false-no-overflow.i [2018-11-10 06:11:05,432 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:11:05,438 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-10 06:11:05,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-10 06:11:05,477 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:11:05,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:11:05,478 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:11:05,478 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:11:05,478 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:11:05,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:11:05,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:11:05,478 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:11:05,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:11:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-10 06:11:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 06:11:05,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:05,502 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:05,504 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:05,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-11-10 06:11:05,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:05,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:11:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 06:11:05,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:11:05,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:11:05,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:11:05,626 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-10 06:11:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:05,647 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-10 06:11:05,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:11:05,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 06:11:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:05,654 INFO L225 Difference]: With dead ends: 157 [2018-11-10 06:11:05,654 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 06:11:05,656 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-11-10 06:11:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 06:11:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-10 06:11:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 06:11:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-10 06:11:05,681 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-10 06:11:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:05,681 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-10 06:11:05,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:11:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-10 06:11:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 06:11:05,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:05,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:05,683 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:05,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-11-10 06:11:05,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:05,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:11:05,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:05,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:11:05,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:11:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:11:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:11:05,746 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-10 06:11:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:05,852 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-10 06:11:05,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:11:05,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 06:11:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:05,853 INFO L225 Difference]: With dead ends: 156 [2018-11-10 06:11:05,853 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 06:11:05,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:11:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 06:11:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-10 06:11:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 06:11:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-10 06:11:05,862 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-10 06:11:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:05,862 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-10 06:11:05,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:11:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-10 06:11:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 06:11:05,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:05,864 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:05,865 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:05,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-11-10 06:11:05,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:11:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:11:05,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:11:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:11:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:11:05,941 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-10 06:11:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,086 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-11-10 06:11:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:11:06,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-10 06:11:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,087 INFO L225 Difference]: With dead ends: 203 [2018-11-10 06:11:06,088 INFO L226 Difference]: Without dead ends: 154 [2018-11-10 06:11:06,088 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-11-10 06:11:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-10 06:11:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-11-10 06:11:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 06:11:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-11-10 06:11:06,096 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-11-10 06:11:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,097 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-11-10 06:11:06,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:11:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-11-10 06:11:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 06:11:06,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,098 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,099 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-11-10 06:11:06,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:11:06,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:06,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:11:06,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:11:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:11:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:11:06,158 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-11-10 06:11:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,335 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-11-10 06:11:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:11:06,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 06:11:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,337 INFO L225 Difference]: With dead ends: 303 [2018-11-10 06:11:06,337 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 06:11:06,338 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-11-10 06:11:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 06:11:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-11-10 06:11:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 06:11:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-10 06:11:06,348 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-11-10 06:11:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,349 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-10 06:11:06,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:11:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-10 06:11:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 06:11:06,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,350 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,351 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-11-10 06:11:06,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:11:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:06,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:11:06,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:11:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:11:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:11:06,429 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-11-10 06:11:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,581 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-11-10 06:11:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:11:06,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 06:11:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,583 INFO L225 Difference]: With dead ends: 482 [2018-11-10 06:11:06,583 INFO L226 Difference]: Without dead ends: 342 [2018-11-10 06:11:06,583 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-11-10 06:11:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-10 06:11:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-10 06:11:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 06:11:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-11-10 06:11:06,591 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-11-10 06:11:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,591 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-11-10 06:11:06,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:11:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-11-10 06:11:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 06:11:06,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,593 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,594 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-11-10 06:11:06,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:11:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:11:06,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:11:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:11:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:11:06,657 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-11-10 06:11:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,796 INFO L93 Difference]: Finished difference Result 490 states and 637 transitions. [2018-11-10 06:11:06,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:11:06,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-10 06:11:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,798 INFO L225 Difference]: With dead ends: 490 [2018-11-10 06:11:06,798 INFO L226 Difference]: Without dead ends: 350 [2018-11-10 06:11:06,799 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-11-10 06:11:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-10 06:11:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-11-10 06:11:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-10 06:11:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2018-11-10 06:11:06,809 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 47 [2018-11-10 06:11:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,809 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2018-11-10 06:11:06,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:11:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2018-11-10 06:11:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 06:11:06,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,811 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,812 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1002470733, now seen corresponding path program 1 times [2018-11-10 06:11:06,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:11:06,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:06,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:11:06,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:11:06,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:11:06,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:11:06,877 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 5 states. [2018-11-10 06:11:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,899 INFO L93 Difference]: Finished difference Result 337 states and 437 transitions. [2018-11-10 06:11:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:11:06,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-10 06:11:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,901 INFO L225 Difference]: With dead ends: 337 [2018-11-10 06:11:06,901 INFO L226 Difference]: Without dead ends: 172 [2018-11-10 06:11:06,901 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-11-10 06:11:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-10 06:11:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-11-10 06:11:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-10 06:11:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2018-11-10 06:11:06,908 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 50 [2018-11-10 06:11:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,908 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2018-11-10 06:11:06,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:11:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2018-11-10 06:11:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 06:11:06,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,909 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,910 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1982405281, now seen corresponding path program 1 times [2018-11-10 06:11:06,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:11:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:11:06,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:11:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:11:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:11:06,964 INFO L87 Difference]: Start difference. First operand 172 states and 220 transitions. Second operand 3 states. [2018-11-10 06:11:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:06,974 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2018-11-10 06:11:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:11:06,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-10 06:11:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:06,975 INFO L225 Difference]: With dead ends: 235 [2018-11-10 06:11:06,976 INFO L226 Difference]: Without dead ends: 202 [2018-11-10 06:11:06,976 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-11-10 06:11:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-10 06:11:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-10 06:11:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-10 06:11:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 258 transitions. [2018-11-10 06:11:06,982 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 258 transitions. Word has length 56 [2018-11-10 06:11:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:06,983 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 258 transitions. [2018-11-10 06:11:06,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:11:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 258 transitions. [2018-11-10 06:11:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 06:11:06,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:06,984 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:06,985 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:06,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1707645667, now seen corresponding path program 1 times [2018-11-10 06:11:06,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:11:07,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:11:07,050 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:11:07,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:07,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:11:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 06:11:07,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:11:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 06:11:07,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 06:11:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:11:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:11:07,182 INFO L87 Difference]: Start difference. First operand 202 states and 258 transitions. Second operand 7 states. [2018-11-10 06:11:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:07,666 INFO L93 Difference]: Finished difference Result 453 states and 621 transitions. [2018-11-10 06:11:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:11:07,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-10 06:11:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:07,667 INFO L225 Difference]: With dead ends: 453 [2018-11-10 06:11:07,667 INFO L226 Difference]: Without dead ends: 274 [2018-11-10 06:11:07,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:11:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-10 06:11:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 202. [2018-11-10 06:11:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-10 06:11:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-11-10 06:11:07,674 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 56 [2018-11-10 06:11:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:07,674 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-11-10 06:11:07,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 06:11:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-11-10 06:11:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 06:11:07,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:07,675 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:07,676 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:07,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1693291530, now seen corresponding path program 1 times [2018-11-10 06:11:07,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 29 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 06:11:07,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:11:07,863 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:11:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:07,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:11:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 06:11:07,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:11:07,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2018-11-10 06:11:07,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 06:11:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 06:11:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 06:11:07,952 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 15 states. [2018-11-10 06:11:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:09,852 INFO L93 Difference]: Finished difference Result 2366 states and 2924 transitions. [2018-11-10 06:11:09,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 06:11:09,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2018-11-10 06:11:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:09,856 INFO L225 Difference]: With dead ends: 2366 [2018-11-10 06:11:09,856 INFO L226 Difference]: Without dead ends: 2084 [2018-11-10 06:11:09,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1775, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 06:11:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2018-11-10 06:11:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 674. [2018-11-10 06:11:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-11-10 06:11:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 878 transitions. [2018-11-10 06:11:09,877 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 878 transitions. Word has length 91 [2018-11-10 06:11:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:09,877 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 878 transitions. [2018-11-10 06:11:09,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 06:11:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 878 transitions. [2018-11-10 06:11:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 06:11:09,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:09,878 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:09,879 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:09,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1395283369, now seen corresponding path program 1 times [2018-11-10 06:11:09,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:09,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 06:11:09,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:11:09,992 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:11:10,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:10,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:11:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 06:11:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:11:10,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2018-11-10 06:11:10,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 06:11:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 06:11:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-10 06:11:10,101 INFO L87 Difference]: Start difference. First operand 674 states and 878 transitions. Second operand 12 states. [2018-11-10 06:11:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:10,452 INFO L93 Difference]: Finished difference Result 1982 states and 2497 transitions. [2018-11-10 06:11:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:11:10,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-10 06:11:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:10,455 INFO L225 Difference]: With dead ends: 1982 [2018-11-10 06:11:10,455 INFO L226 Difference]: Without dead ends: 1344 [2018-11-10 06:11:10,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-11-10 06:11:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2018-11-10 06:11:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 780. [2018-11-10 06:11:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-11-10 06:11:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1005 transitions. [2018-11-10 06:11:10,474 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1005 transitions. Word has length 94 [2018-11-10 06:11:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:10,475 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 1005 transitions. [2018-11-10 06:11:10,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 06:11:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1005 transitions. [2018-11-10 06:11:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 06:11:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:10,476 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:10,477 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1202449943, now seen corresponding path program 1 times [2018-11-10 06:11:10,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:10,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:10,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 06:11:10,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:11:10,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 06:11:10,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 06:11:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:11:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:11:10,547 INFO L87 Difference]: Start difference. First operand 780 states and 1005 transitions. Second operand 8 states. [2018-11-10 06:11:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:12,028 INFO L93 Difference]: Finished difference Result 2263 states and 2928 transitions. [2018-11-10 06:11:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 06:11:12,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-10 06:11:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:12,032 INFO L225 Difference]: With dead ends: 2263 [2018-11-10 06:11:12,033 INFO L226 Difference]: Without dead ends: 1495 [2018-11-10 06:11:12,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-10 06:11:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-11-10 06:11:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1189. [2018-11-10 06:11:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2018-11-10 06:11:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1527 transitions. [2018-11-10 06:11:12,079 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1527 transitions. Word has length 94 [2018-11-10 06:11:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:12,080 INFO L481 AbstractCegarLoop]: Abstraction has 1189 states and 1527 transitions. [2018-11-10 06:11:12,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 06:11:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1527 transitions. [2018-11-10 06:11:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 06:11:12,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:12,082 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:12,083 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:12,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:12,083 INFO L82 PathProgramCache]: Analyzing trace with hash 306675059, now seen corresponding path program 1 times [2018-11-10 06:11:12,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:12,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:12,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:12,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:12,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 35 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 06:11:12,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:11:12,287 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:11:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:12,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:11:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 50 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 06:11:12,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:11:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 06:11:12,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 06:11:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 06:11:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-10 06:11:12,606 INFO L87 Difference]: Start difference. First operand 1189 states and 1527 transitions. Second operand 14 states. [2018-11-10 06:11:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:13,177 INFO L93 Difference]: Finished difference Result 2857 states and 3496 transitions. [2018-11-10 06:11:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 06:11:13,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2018-11-10 06:11:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:13,184 INFO L225 Difference]: With dead ends: 2857 [2018-11-10 06:11:13,184 INFO L226 Difference]: Without dead ends: 2835 [2018-11-10 06:11:13,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-11-10 06:11:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2018-11-10 06:11:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1122. [2018-11-10 06:11:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-11-10 06:11:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1465 transitions. [2018-11-10 06:11:13,234 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1465 transitions. Word has length 96 [2018-11-10 06:11:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:13,235 INFO L481 AbstractCegarLoop]: Abstraction has 1122 states and 1465 transitions. [2018-11-10 06:11:13,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 06:11:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1465 transitions. [2018-11-10 06:11:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 06:11:13,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:13,237 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:11:13,238 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:13,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1916333174, now seen corresponding path program 1 times [2018-11-10 06:11:13,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:13,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 84 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 06:11:13,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:11:13,323 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a23f7d6-b43b-444c-b871-f7cafd2943cc/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:11:13,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:11:13,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:11:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 06:11:13,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:11:13,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-11-10 06:11:13,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 06:11:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:11:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=24, Unknown=2, NotChecked=0, Total=42 [2018-11-10 06:11:13,891 INFO L87 Difference]: Start difference. First operand 1122 states and 1465 transitions. Second operand 7 states. [2018-11-10 06:11:16,556 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 06:11:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:11:21,862 INFO L93 Difference]: Finished difference Result 2745 states and 3566 transitions. [2018-11-10 06:11:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:11:21,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-10 06:11:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:11:21,864 INFO L225 Difference]: With dead ends: 2745 [2018-11-10 06:11:21,865 INFO L226 Difference]: Without dead ends: 1497 [2018-11-10 06:11:21,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=44, Invalid=61, Unknown=5, NotChecked=0, Total=110 [2018-11-10 06:11:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-11-10 06:11:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1420. [2018-11-10 06:11:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-11-10 06:11:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1815 transitions. [2018-11-10 06:11:21,921 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1815 transitions. Word has length 100 [2018-11-10 06:11:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:11:21,921 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 1815 transitions. [2018-11-10 06:11:21,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 06:11:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1815 transitions. [2018-11-10 06:11:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 06:11:21,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:11:21,923 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-10 06:11:21,924 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:11:21,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:11:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash 831355282, now seen corresponding path program 1 times [2018-11-10 06:11:21,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:11:21,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:11:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:21,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:11:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:11:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:11:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:11:22,007 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 06:11:22,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:11:22 BoogieIcfgContainer [2018-11-10 06:11:22,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:11:22,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:11:22,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:11:22,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:11:22,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:11:05" (3/4) ... [2018-11-10 06:11:22,062 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:11:22,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:11:22,063 INFO L168 Benchmark]: Toolchain (without parser) took 17264.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 960.2 MB in the beginning and 878.4 MB in the end (delta: 81.8 MB). Peak memory consumption was 405.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:11:22,064 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:11:22,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:11:22,064 INFO L168 Benchmark]: Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:11:22,065 INFO L168 Benchmark]: RCFGBuilder took 404.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:11:22,065 INFO L168 Benchmark]: TraceAbstraction took 16639.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 230.3 MB). Peak memory consumption was 407.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:11:22,066 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 878.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:11:22,068 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.10 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 184.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 404.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16639.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 230.3 MB). Peak memory consumption was 407.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 878.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; [L106] a = __VERIFIER_nondet_uint() [L108] b = 234770789 VAL [a=-2382254337, b=234770789] [L110] CALL mp_add(a, b) VAL [\old(a)=1912712959, \old(b)=234770789] [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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=65106, r0=917074] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=917074] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] COND TRUE i == (unsigned char)2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=917074, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] COND TRUE i == (unsigned char)3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 38 error locations. UNSAFE Result, 16.5s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 13.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1653 SDtfs, 3006 SDslu, 5475 SDs, 0 SdLazy, 4897 SolverSat, 387 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 445 SyntacticMatches, 10 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1420occurred in iteration=14, 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4513 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1239 ConstructedInterpolants, 26 QuantifiedInterpolants, 511262 SizeOfPredicates, 13 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 931/1036 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...